|
1
|
On the Security of RDSA 475
– A Fiat, A Shamir
- 1987
|
|
4
|
A Signature Scheme Based on the Intractability of Computing Roots
– Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
- 2000
|
|
48
|
Lattice Reduction: a Toolbox for the Cryptanalyst
– Antoine Joux, Jacques Stern
- 1994
|
|
99
|
Self-certified Public Keys
– M Girault
- 1991
|
|
49
|
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
– Phong Q. Nguyen, Igor E. Shparlinski
- 2000
|
|
512
|
Efficient signature generation for smart cards
– C P Schnorr
- 1991
|
|
184
|
Lower Bounds for Discrete Logarithms and Related Problems
– Victor Shoup
- 1997
|
|
227
|
Security Arguments for Digital Signatures and Blind Signatures
– David Pointcheval, Jacques Stern
- 2000
|
|
193
|
Monte Carlo methods for index computation (mod p
– J M Pollard
- 1978
|
|
262
|
Efficient Identification and Signatures for Smart Cards. CRYPTO
– C P Schnorr
- 1989
|
|
554
|
Factoring polynomials with rational coefficients
– A K Lenstra, H W Lenstra, L Lovász
- 1982
|
|
27
|
Security Analysis of a Practical "on the fly" Authentication and Signature Generation
– Guillaume Poupard, Jacques Stern
- 1998
|
|
1
|
exponentiation with precomputation
– Fast
- 1993
|
|
1
|
Problems and solutions: Addition chains of vectors
– E Straus
- 1964
|
|
35
|
Efficient Elliptic Curve Exponentiation
– Atsuko Miyaji, Takatoshi Ono, Henri Cohen, Université Bordeaux
- 1997
|
|
7
|
Complexity and fast algorithms for multiexponentiation
– V. S. Dimitrov, V. S. Dimitrov, G. A. Jullien, G. A. Jullien, W. C. Miller, W. C. Miller
- 2000
|
|
26
|
Efficient exponentiation using precomputation and vector addition chains
– P De Rooij
- 1994
|
|
41
|
Addition chain heuristics
– J Bos, M Coster
- 1990
|
|
64
|
More Flexible Exponentiation with Precomputation
– Chae Hoon Lim, Pil Joong Lee
- 1994
|
