2014/08/31 by Shenghui Su, Shuwang Lu, Maozhi Xu +1 · 1 citation
Computer Science · #cs.CR
published as Theoretical Computer Science, v654, Nov 2016, pp.113-127 · 16 Pages. arXiv admin note: text overlap with arXiv:1408.5999
arxiv created 2017/04/30 · arxiv updated 2017/05/02
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 lgM of the new cryptoscheme to 464, 544, or 640.