Paper 2009/022

Correctness of Li Generalization of RSA Cryptosystem

Roman Popovych

Abstract

For given N=pq with p and q different odd primes and natural m Li introduced the public key cryptosystem. In the case m=1 the system is just the famous RSA system. We answer the Li question about correctness of the system.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
RSA
Contact author(s)
popovych @ polynet lviv ua
History
2009-01-13: received
Short URL
https://ia.cr/2009/022
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/022,
      author = {Roman Popovych},
      title = {Correctness of Li Generalization of RSA Cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2009/022},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/022}},
      url = {https://eprint.iacr.org/2009/022}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.