A new public-key encryption scheme based on LUCas sequence
Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.
Key wordsProbabilistic public-key encryption scheme LUCas sequence(LUC) Discrete logarithm Integer factorization
Unable to display preview. Download preview PDF.
- P. Smith, M. Lennon, LUC: A new public-key system, Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security, Toronto, May 12–14, 1993, 103–117.Google Scholar
- D. Bleichenbacher, W. Bosma, et al., Some remarks on Lucas-based cryptosystems, Advances in Cryptology-CRYPTO’95, LNCS 963, Berlin, Springer-Verlag, 1995, 386–396.Google Scholar
- M. Adleman, J. DeMarrais, A subexponential algorithm over all finite fields, Advances in Cryptology-CRYPTO’93, LNCS 773, Berlin, Springer-Verlag, 1993, 147–158.Google Scholar
- A. E. Brouwer, R. Pellikaan, et al., Doing more with fewer bits, Advances in Cryptology-ASIACRYPT’99, LNCS 1716, Berlin, Springer-Verlag, 1999, 321–332.Google Scholar
- P. Paillier, Efficient public-key cryptosystem provably secure against active adversaries, Advances in Cryptology-ASIACRYPT’99, LNCS 1716, Springer-Verlag, 1999, 159–179.Google Scholar
- I. B. Damgard, M. J. Jurik, Efficient protocols based on probabilistic encryption using composite degree residue classes, http://www.brics.dk/RS/00/5/BRICS-RS-00-5.pdf.Google Scholar