|
|
CryptoBytes 3 (1), 1997
– RSA Laboratories
- 1997
|
|
5
|
Implementation of fast RSA key generation on smart cards
– Chenghuai Lu
- 2002
|
|
3
|
Some Primality Testing Algorithms
– R.G.E. Pinch
- 1993
|
|
20
|
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
– Ueli M. Maurer
- 1995
|
|
127
|
Signature Schemes Based on the Strong RSA Assumption
– Ronald Cramer, Victor Shoup
- 1998
|
|
5
|
MODULAR EXPONENTIATION VIA THE EXPLICIT CHINESE REMAINDER THEOREM
– Daniel J. Bernstein, Jonathan, P. Sorenson
|
|
|
Specification of ESIGN Signatures
– At Ur Es
|
|
|
Self-Evaluation ESIGN Signatures
– Esign Signatur Es
|
|
3
|
ACE: The Advanced Cryptographic Engine
– Thomas Schweinberger, Victor Shoup
- 2000
|
|
1
|
FIPS PUB 186-3 FEDERAL INFORMATION PROCESSING STANDARDS PUBLICATION Digital Signature Standard (DSS)
– Patrick Gallagher, Deputy Director Foreword, Cita Furlani Director
- 2009
|
|
3
|
Finding prime pairs with particular gaps
– Pamela A. Cutter
- 2002
|
|
|
On the Distributions of Pseudoprimes, Carmichael Numbers, and
– Strong Pseudoprimes, Aran Nayebi
- 2009
|
|
|
Cryptanalysis of Koyama Scheme
– Sahdeo Padhye
- 2006
|
|
9
|
On the design of RSA with short secret exponent
– Hung-min Sun, Wu-chuan Yang, Chi, Sung Laih
- 1999
|
|
2
|
Constructing Elliptic Curves With a Given Number of Points Over a Finite Field
– Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan
- 2001
|
|
2
|
F.: Kleptographic weaknesses in Benaloh-Tuinstra protocol
– Piotr Borzecki, Jedrzej Kabarowski, Przemysław Kubiak, Mirosław Kutyłowski, Filip Zagórski, Filip Zagórski
- 2006
|
|
6
|
Multidigit Modular Multiplication With The Explicit Chinese Remainder Theorem
– Daniel J. Bernstein
- 1995
|
|
22
|
Asymptotic semismoothness probabilities
– Eric Bach, René Peralta
- 1996
|
|
|
ABSOLUTE QUADRATIC PSEUDOPRIMES
– Richard G. E. Pinch
|
