Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project

doi:10.1049/iet-ifs.2019.0214

CORC > 数学与系统科学研究院 > 中国科学院数学与系统科学研究院 > 系统科学研究所

	Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project
	Liu, Zhen 1,2,3; Pan, Yanbin 3; Xie, Tianyuan 1,3
刊名	IET INFORMATION SECURITY
	2020-05-01
卷号	14 期号:3 页码:313-320
关键词	decoding public key cryptography quantum cryptography computational complexity optimisation cyclic codes IND-CPA security NIST PQC project hamming quasicyclic cryptosystem code-based key encapsulation mechanism NIST standardisation process public-key encryption scheme IND-CCA2 secure KEM revised scheme HQC- beta HQC cryptosystem s-DQCSD problem s-decision quasi-cyclic syndrome decoding plaintext attack
ISSN号	1751-8709
DOI	10.1049/iet-ifs.2019.0214
英文摘要	Hamming quasi-cyclic (HQC) cryptosystem, proposed by Aguilar Melchoret al., is a code-based key encapsulation mechanism (KEM) submitted for the NIST standardisation process of post-quantum cryptography (PQC). Under the assumption that thes-decision quasi-cyclic syndrome decoding (s-DQCSD) problem is hard fors = 2 and 3, HQC, viewed as a public-key encryption scheme, is proven to be indistinguishability under chosen plaintext attack (IND-CPA) secure, and can be transformed into an IND-Adaptive chosen ciphertext attack secure KEM. However, the authors will show that thes-DQCSD problem is actually not intractable and HQC cannot attain IND-CPA security with all the proposed parameter sets. As HQC was selected as one of the second-round candidates by NIST, it was also updated to resist attack. The underlyings-DQCSD problem was replaced by thes-DQCSD with a parity problem and they claimed that the updated HQC could attain IND-CPA security under the hardness of the new problem. However, they find that there is some flaw in their security proof and the updated HQC is still vulnerable to attack. To fix it, they define a new problem calleds-DQCSD with variable weight and present revised scheme HQC-beta, which finally attains the IND-CPA security under the hardness assumption of the new problem.
资助项目	NNSF of China[61572490] ; National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences
WOS研究方向	Computer Science
语种	英语
出版者	INST ENGINEERING TECHNOLOGY-IET
WOS记录号	WOS:000561335400006
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/52045]
专题	系统科学研究所
通讯作者	Pan, Yanbin
作者单位	1.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China 2.State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China 3.Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Math Mechanizat, NCMIS, Beijing 100190, Peoples R China
推荐引用方式 GB/T 7714	Liu, Zhen,Pan, Yanbin,Xie, Tianyuan. Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project[J]. IET INFORMATION SECURITY,2020,14(3):313-320.
APA	Liu, Zhen,Pan, Yanbin,&Xie, Tianyuan.(2020).Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project.IET INFORMATION SECURITY,14(3),313-320.
MLA	Liu, Zhen,et al."Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project".IET INFORMATION SECURITY 14.3(2020):313-320.