QQ客服 官方微博 反馈留言

	Quantum cryptanalysis of multivariate permutation problem
	Sun, Guodong ; Su, Shenghui ; Xu, Maozhi
	2014
英文摘要	Quantum computation is a new computational model based on quantum mechanical principle. Shor invented the polynomial time algorithms for the prime factorization and discrete logarithm problem, which indicated that the cryptosystems based on them are totally unsafe in the quantum world. Grover constructed an algorithm that finds a solution in only O(??2 n )steps whereas the exhaustive search algorithm needs O(2 n ) steps on average. In this paper we investigate the cryptanalysis of a new cryptography problem-multivariate permutation problem (MPP), which could be used to design public-key cryptosystem, with the help of the two quantum algorithms. Specially, we discuss the strength of a private key of the REESSE1+ public-key cryptosystem, whose security is based on the hardness of MPP. Besides, some suggestions are also given about the implementation of the REESSE1+.; EI; 0; 6; 261-272; 8
语种	英语
出处	EI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/408948]
专题	数学科学学院
推荐引用方式 GB/T 7714	Sun, Guodong,Su, Shenghui,Xu, Maozhi. Quantum cryptanalysis of multivariate permutation problem. 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。