Far Eastern Mathematical Journal

To content of the issue


A new method for generating keys in the RSA cryptosystem


Markova N.V.

2020, issue 2, . 221223
DOI: https://doi.org/10.47910/FEMJ202021


Abstract
V.A. Bykovsky built a new version of the RSA cryptosystem, in which for the same private key lengths the length of the public key decreases asymptotically by a factor of three. The paper proposes a new construction on this theme, in which the length of the public key is reduced by more than three times.

Keywords:
Number theory, cryptography, RSA cryptosystem

Download the article (PDF-file)

References

[1] R.L. Rivest, A. Shamir, L. Adleman, Method for Obtaining Digital Signatures and Public Key Cryptosystems, Commun. ACM, 21:2, (1978), 120126.
[2] O. N. Vasilenko, Teoretiko-chislovye algoritmy v kriptografii, MTsNMO, M., 2003, 328 s.
[3] V. A. Bykovskii., Vychislenie sluchainykh par prostykh chisel, proizvedenie kotorykh lezhit v zadannom korotkom intervale, Preprint IPM DVO RAN, Dal'nauka, Vladivostok, Khabarovsk, 1994, 7 s.

To content of the issue