Welcome to the resource topic for 2005/285
Title:
Generalizations of RSA public key cryptosystems
Authors: 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.
ePrint: https://eprint.iacr.org/2005/285
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .