Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Accelerating Okamoto-Uchiyama public-key cryptosystem

Accelerating Okamoto-Uchiyama public-key cryptosystem

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In Eurocrypt'98, Okamoto and Uchiyama 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 O(log2n) while preserving equivalence to factoring.

References

    1. 1)
      • Paillier, P.: `A trapdoor permutation equivalent to factoring', LNCS, Proc. PKC'99, 1999, Springer-Verlag.
    2. 2)
      • Okamoto, T., Uchiyama, S.: `A new public-key cryptosystem as secure as factoring', LNCS 1403, Advances in Cryptology, Proc. Eurocrypt'98, 1998, Springer-Verlag, p. 308–318.
    3. 3)
      • E. Okamoto , R. Peralta . Faster factoring of integers of a special form. IEICE Trans. Fundamentals , 4 , 489 - 493
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990229
Loading

Related content

content/journals/10.1049/el_19990229
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address