Paper 2005/285
Generalizations of RSA public key cryptosystems
Li Banghe
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.
Note: I have revised the paper, more complete and clear comparing the original version
Metadata
- Available format(s)
-
PDF
PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Public key cryptosystemRSA
- Contact author(s)
- libh @ amss ac cn
- History
- 2005-10-26: last of 2 revisions
- 2005-08-25: received
- See all versions
- Short URL
- https://ia.cr/2005/285
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/285,
author = {Li Banghe},
title = {Generalizations of {RSA} public key cryptosystems},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/285},
year = {2005},
url = {https://eprint.iacr.org/2005/285}
}
