QQ客服 官方微博 反馈留言

	A semantically secure public key cryptoscheme using bit-pair shadows
	Su, Shenghui ; Lu, Shuwang ; Xu, Maozhi ; Xie, Tao
	2016
关键词	Public key cryptoscheme Semantical security Bit-pair shadow Random padding Anomalous subset sum problem Compact sequence CRYPTOSYSTEM ENCRYPTION SIGNATURES REDUCTION
英文摘要	This paper gives the definition and property of a bit-pair shadow, and devises the three algorithms of a public key cryptoscheme called JUOAN that is 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 a manipulation unit. The authors 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 cryptoscheme 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 the new cryptoscheme using random padding and random permutation is semantically secure. The analysis shows that the bit-pair method increases the density D of a related knapsack to a number more than 1, and decreases the modulus length [1gM] of the new cryptoscheme to 464, 544, or 640. (C) 2016 Elsevier B.V. All rights reserved.; SCI(E); ARTICLE; reesse@126.com; ,SI; 113-127; 654
语种	英语
出处	SCI
出版者	21st Annual International Computing and Combinatorics Conference (COCOON)
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/458392]
专题	数学科学学院
推荐引用方式 GB/T 7714	Su, Shenghui,Lu, Shuwang,Xu, Maozhi,et al. A semantically secure public key cryptoscheme using bit-pair shadows. 2016-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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