CryptoDB
The REESSE1+ Public-key Cryptosystem
Authors: | |
---|---|
Download: | |
Abstract: | This paper gives the definition of a coprime sequence and the concept of the lever function, describes the five algorithms and six characteristics of the REESSE1+ public-key cryptosystem based on three new hardnesses: the modular subset product problem, the multivariate arrangement problem, and the super logarithm problem in a prime field, shows the correctness of the decryption algorithm, and infers that the probability that a plaintext solution is not unique is nearly zeroth. The authors analyze the security of REESSE1+ against recovering a related plaintext from a ciphertext, extracting a related private key from a public key or a signature, and faking a digital signature via a public key or a known signature with a public key, discuss the super logarithm problem, and believe that the security of REESSE1+ is at least equal to the time complexity of O(2^n) at present. At last, the paper expounds the idea of optimizing REESSE1+ through binary compact sequences. |
BibTeX
@misc{eprint-2006-21911, title={The REESSE1+ Public-key Cryptosystem}, booktitle={IACR Eprint archive}, keywords={Public-key cryptography / Multiproblem public-key cryptosystem, Coprime sequence, Security, Lever function, Super logarithm problem, Double congruence theorem.}, url={http://eprint.iacr.org/2006/420}, note={No Publication sheenway@126.com 14644 received 15 Nov 2006, last revised 4 Feb 2010}, author={Shenghui Su and Shuwang Lu}, year=2006 }