A new method for generating keys in the RSA cryptosystem
Dalʹnevostočnyj matematičeskij žurnal, Tome 20 (2020) no. 2, pp. 221-223
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
@article{DVMG_2020_20_2_a8,
author = {N. V. Markova},
title = {A new method for generating keys in the {RSA} cryptosystem},
journal = {Dalʹnevosto\v{c}nyj matemati\v{c}eskij \v{z}urnal},
pages = {221--223},
year = {2020},
volume = {20},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DVMG_2020_20_2_a8/}
}
N. V. Markova. A new method for generating keys in the RSA cryptosystem. Dalʹnevostočnyj matematičeskij žurnal, Tome 20 (2020) no. 2, pp. 221-223. http://geodesic.mathdoc.fr/item/DVMG_2020_20_2_a8/
[1] R. L. Rivest, A. Shamir, L. Adleman, “Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Commun. ACM, 21:2 (1978), 120–126 | DOI | MR | Zbl
[2] O. N. Vasilenko, Teoretiko-chislovye algoritmy v kriptografii, MTsNMO, M., 2003, 328 pp.
[3] V. A. Bykovskii., Vychislenie sluchainykh par prostykh chisel, proizvedenie kotorykh lezhit v zadannom korotkom intervale, Preprint IPM DVO RAN, Dalnauka, Vladivostok, Khabarovsk, 1994, 7 pp.