New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n (1991)

Cached

Download Links

by Kenji Koyama , Ueli M Maurer , Tatsuaki Okamoto , Scott A Vanstone
Citations:46 - 0 self

Active Bibliography

9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – Fran├žois Morain - 1988
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory – San C. Vo - 2003
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
26 The Diffie-Hellman Protocol – Ueli M. Maurer, Stefan Wolf - 1999
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
Codes -- The Guide to Secrecy . . . – Richard A. Mollin
38 The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms – Ueli M. Maurer , Stefan Wolf - 1998
18 Building Cyclic Elliptic Curves Modulo Large Primes – Fran├žois Morain - 1987
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
Cryptographic Primitives – Paul Garrett - 2007
1 Cryptology – Prof Ronald Rivest, L. Rivest
10 Searching for Elements in Black Box Fields and Applications – Dan Boneh, Richard Lipton - 1996
1 Public Key Cryptosystems using Elliptic Curves – J. Borst - 1997
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
69 Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms – Ueli M. Maurer - 1994
SEC 1: Elliptic . . . – n.n. - 2000
9 On the importance of securing your bins: The garbage-man-in-the-middle attack – Marc Joye, Jean-Jacques Quisquater - 1997
3 Elliptic Curves and their use in Cryptography – Victor S. Miller - 1997
7 Automorphisms of Finite Rings and Applications to Complexity of Problems – Manindra Agrawal, Nitin Saxena - 2005