An algebraic method for public-key cryptography

Mathematical Research Letters

Volumn 6, Issue 3-4, 1999, Pages 287-291

  Anshel, Iris ^a   Anshel, Michael ^a   Goldfeld, Dorian ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033245872     PISSN: 10732780     EISSN: None     Source Type: Journal    
DOI: 10.4310/MRL.1999.v6.n3.a3     Document Type: Article

References (9)

1. [1] I.L. Anshel and M. Anshel, From the Post-Markov theorem through decision problems to public-key cryptography, Amer. Math. Monthly 100 (1993), 835-844.
2. [2] J.S. Birman, K.H. Ko, and S.J. Lee, A new approach to the word and conjugacy problems in the braid groups, Adv. Math. 139 (1998), 322-353.
3. [3] D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46 (1999), 203-213.
4. [4] P. Dehornoy, A fast method for comparing braids, Adv. Math. 125 (1997), 200-235.
5. [5] Do Long Van, A. Jeyanthi, R. Siromoney, and K.G. Subramanian, Public key cryptosystems based on word problems, ICOMIDC Symp. Math. of Computation, Ho Chi Minh City, April 1988.
6. [6] N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computation in Mathematics, 3., Springer-Verlag, Berlin, 1998.
7. [7] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, CRC Press Series on Discrete Mathematics and its Applications., CRC Press, Boca Raton, FL, 1997.
8. [8] C.F. Miller III, On group-theoretic decision problems and their classification, Annals of Mathematics Studies, No. 68., Princeton University Press, Princeton, NJ, 1971.
9. [9] P.C. van Oorschot and M.J. Wiener, Parallel collision search with cryptanalytic applications, J. Cryptology 12 (1999), 1-28.