Remarks concerning RSA-cryptosystem exponents
Mathematica slovaca, Tome 44 (1994) no. 2, pp. 279-285
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68P25, 94A60
@article{MASLO_1994_44_2_a13,
     author = {Gro\v{s}ek, Otokar},
     title = {Remarks concerning {RSA-cryptosystem} exponents},
     journal = {Mathematica slovaca},
     pages = {279--285},
     year = {1994},
     volume = {44},
     number = {2},
     mrnumber = {1282540},
     zbl = {0794.94011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1994_44_2_a13/}
}
TY  - JOUR
AU  - Grošek, Otokar
TI  - Remarks concerning RSA-cryptosystem exponents
JO  - Mathematica slovaca
PY  - 1994
SP  - 279
EP  - 285
VL  - 44
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1994_44_2_a13/
LA  - en
ID  - MASLO_1994_44_2_a13
ER  - 
%0 Journal Article
%A Grošek, Otokar
%T Remarks concerning RSA-cryptosystem exponents
%J Mathematica slovaca
%D 1994
%P 279-285
%V 44
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1994_44_2_a13/
%G en
%F MASLO_1994_44_2_a13
Grošek, Otokar. Remarks concerning RSA-cryptosystem exponents. Mathematica slovaca, Tome 44 (1994) no. 2, pp. 279-285. http://geodesic.mathdoc.fr/item/MASLO_1994_44_2_a13/

[1] BLAKELY B., BLAKELY G. R.: Security of number theoretic public key cryptosystems against random attack I. Cryptologia 2 (1978), 305-321. | MR

[2] BLAKELY B., BLAKELY G. R.: Security of number theoretic public key cryptosystems gainst random attack II. Cryptologia 3 (1979), 29-42. | MR

[3] BLAKELY B., BLAKELY G. R.: Security of number theoretic public key cryptosystems against random attack. Cryptologia 3 (1979), 105-118. | MR

[4] BLAKELY G. R., BOROSH I.: Rivest-Shamir-Adelman public key cryptosystem do not always conceal messages. Comput. Math. Appl. 5 (1979), 105-118. | MR

[5] ECKER A.: Finite semigroups and the RSA-cryptosystem. In: Lecture Notes in Comput. Sci. 149, Springer, New York-Berlin, 1983, pp. 353-369. | MR | Zbl

[6] GORDON J.: Strong primes are easy to find. In: Advances in CRYPTOLOGY, EUROCRYPT'84, Spinger Verlag, Berlin, 1985, pp. 216-223. | MR | Zbl

[7] NIVEN I., ZUCKERMAN H. S.: An Introduction to the Theory of Numbers. John Wiley & Sons Inc., New York, 1972. | MR | Zbl

[8] RIVEST R. L.: Remarks on a proposed cryptanalytic attack on the M.I.T. public-key cryptosystem. Cryptologia 2 (1978), 62-65.

[9] SIMMONS G. J., NORRIS M. J.: Preliminary comments on the M.I.T. public-key cryptosystem. Cryptologia 1 (1977), 406-414.

[10] SCHWARZ S.: The role of semigroups in the elementary theory of numbers. Math. Slovaca 31 (1981), 369-395. | MR | Zbl