International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Generalizations of RSA public key cryptosystems

Authors:
Li Banghe
Download:
URL: http://eprint.iacr.org/2005/285
Search ePrint
Search Google
Abstract: In this paper, for given $N=pq$ with $p$ and $q$ different primes and a unimodular polynomial with coefficients in ${\Bbb Z}$ mod $N$, we give a public key cryptosystem. When the degree of the polynomial is $1$, the system is just the famous RSA system. And when the degree bigger than $1$, the system is usually more secure than the original RSA systems. Some part-correct systems are introduced so that the period of any message in these systems under the Simmons attack are bigger than that of any message in the RSA system.
BibTeX
@misc{eprint-2005-12619,
  title={Generalizations of RSA public key cryptosystems},
  booktitle={IACR Eprint archive},
  keywords={Public key cryptosystem; RSA},
  url={http://eprint.iacr.org/2005/285},
  note={ libh@amss.ac.cn 13082 received 23 Aug 2005, last revised 26 Oct 2005},
  author={Li Banghe},
  year=2005
}