|
1
|
Computational Methods in Public Key Cryptology
– Arjen K. Lenstra
- 2002
|
|
|
Small Base Groups, Large Base Groups and the Case of Giants
– Jonathan Cohen
|
|
|
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory
– San C. Vo
- 2003
|
|
|
Cryptographic Primitives
– Paul Garrett
- 2007
|
|
|
STRUCTURE COMPUTATION AND DISCRETE LOGARITHMS IN FINITE ABELIAN p-GROUPS
– Andrew V. Sutherland
|
|
124
|
Software Implementation of Elliptic Curve Cryptography Over Binary Fields
– Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes
- 2000
|
|
22
|
An Overview of Elliptic Curve Cryptography
– Julio López, Ricardo Dahab
- 2000
|
|
39
|
Parallel Algorithms for Integer Factorisation
– Richard P. Brent
|
|
268
|
Guide to Elliptic Curve Cryptography
– Aleksandar Jurisic, Alfred J. Menezes
- 2004
|
|
99
|
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
– Jan Camenisch, Markus Michels
- 1998
|
|
|
Studies on High-Speed Hardware . . .
– Kimmo Järvinen
- 2008
|
|
6
|
Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
– Detlef Hühnlein
|
|
4
|
On the insecurity of a server-aided RSA protocol
– Phong Q. Nguyen, Igor E. Shparlinski
- 2001
|
|
1
|
On the Insecurity of Some Server-Aided RSA Protocol
– Phong Q. Nguyen, Igor E. Shparlinski
|
|
1
|
A GENERIC APPROACH TO SEARCHING FOR JACOBIANS
– Andrew V. Sutherland
- 2009
|
|
|
Codes -- The Guide to Secrecy . . .
– Richard A. Mollin
|
|
149
|
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
– Ronald Cramer, Victor Shoup
- 2001
|
|
47
|
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
– R. Gallant, R. Lambert, S. Vanstone
- 2001
|
|
|
Discrete logarithms: The past and the future
– Andrew Odlyzko Att, Andrew Odlyzko
- 2000
|
