QQ客服 官方微博 反馈留言

	A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security
	Su, Shenghui ; Lu, Shuwang ; Xu, Maozhi
	2015
关键词	Public key cryptoscheme Semantical security Bit-pair shadow Random padding Anomalous subset sum problem Compact sequence ENCRYPTION STANDARD CRYPTOSYSTEM SIGNATURES KNAPSACKS TRAPDOOR
英文摘要	The authors give the definition and property of a bit-pair shadow, and design the algorithms of a public key cryptoscheme based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far, and regards a bit-pair as an operation unit. Further, demonstrate that the decryption algorithm is correct, deduce the probability that a plaintext solution is nonunique is nearly zero, analyze the security of the new scheme against extracting a private key from a public key and recovering a plaintext from a ciphertext on the assumption that an integer factorization problem, a discrete logarithm problem, and a low-density subset sum problem can be solved efficiently, and prove that new scheme using random padding and permutation is semantically secure. The analysis shows that the bit-pair method increases the density D of a related knapsack to 1+, and decreases the modulus length inverted right perpendicular lg M inverted left perpendicular of the new scheme to 464, 544, or 640.; EI; CPCI-S(ISTP); reesse@126.com; 674-686; 9198
语种	英语
出处	SCI ; EI
出版者	COMPUTING AND COMBINATORICS
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/424289]
专题	数学科学学院
推荐引用方式 GB/T 7714	Su, Shenghui,Lu, Shuwang,Xu, Maozhi. A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security. 2015-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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