Title :
Accelerating Okamoto-Uchiyama public-key cryptosystem
Author :
Coron, J.-S. ; Naccache, D. ; Paillier, P.
Author_Institution :
Ecole Normale Superieure, Paris, France
fDate :
2/18/1999 12:00:00 AM
Abstract :
Recently, Okamoto and Uchiyama (see Proc. Eurocrypt´98, p. 308-318, 1998) presented a public-key cryptosystem as secure as factoring n=p2q; in terms of decryption complexity. The scheme is basically equivalent to RSA and requires O(log3n) bit operations. The authors point out a slight morphological modification in the scheme´s structure that lowers the decryption complexity to (log3n) while preserving equivalence to factoring
Keywords :
computational complexity; public key cryptography; Okamoto-Uchiyama cryptosystem; decryption complexity; morphological modification; public-key cryptosystem;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19990229
