Links:
Crypto
seminars at Waterloo,
LNCS,
Journal of
Cryptology,
eprint.
- Primality testing
- M. Agrawal, N. Kayal and N. Saxena,
"Primes is in P", Annals of Mathematics, Volume 160, No. 2, 2004, 781-793.
This paper proves that the problem of determining whether a number n
is prime or composite can be solved in deterministic polynomial time.
- Integer factorization.
Special-purpose hardware for accelerating linear algebra
- A. Lenstra, A. Shamir, J. Tomlinson and E. Tromer,
Analysis of Bernstein's factorization circuit,
Proceedings of ASIACRYPT 2002, 2002, 1-26.
- M. Wiener,
The full cost
of cryptanalytic attacks,
Journal of Cryptology, 17 (2004), 105-124.
- Integer factorization.
Optical hardware for accelerating sieving
- Integer factorization.
Special-purpose hardware for accelerating sieving
- A. Shamir and E. Tromer,
On the cost of factoring RSA-1024,
RSA CryptoBytes, volume 6, number 2, 2003, 10-19.
- A. Shamir and E. Tromer,
Factoring large numbers with the TWIRL device,
Proceedings of CRYPTO 2003, 2003, 1-26.
- A. Lenstra, E. Tromer, A. Shamir, W. Kortsmit, B. Dodson,
J. Hughes and P. Leyland,
Factoring estimates for a 1024-bit RSA modulus,
Proceedings of ASIACRYPT 2003, 2003, 55-74.
- Integer factorization.
The elliptic curve factoring algorithm
- R. Crandall and C. Pomerance, Prime Numbers: A Computational
Perspective, Springer-Verlag, 2001.
- Integer factorization.
The number field sieve factoring algorithm
- R. Crandall and C. Pomerance, Prime Numbers: A Computational
Perspective, Springer-Verlag, 2001.
- Integer factorization.
Factoring integers of a special form
- RSA security.
Finding cube roots modulo n may be easier than factoring
- RSA security.
Finding cube roots modulo n may be as hard as factoring
- RSA signature schemes.
Chosen-message attacks on some RSA signature schemes
- RSA-like signature schemes.
Provably-secure and fast Rabin-Williams signature sheme
- Discrete logarithm problem.
Parallelizing Pollard's rho algorithm
- Discrete logarithm problem.
Coppersmith's algorithm for computing logarithms in
F_{2m}^{*}
- D. Coppersmith, Fast evaluation of logarithms in fields of
characteristic two, IEEE Transactions on Information Theory,
volume 30 (1984), pages 587-594.
- R. Thome,
Computation of discrete logarithms in
F_{2607},
Proceedings of Asiacrypt 2001, 2001, 107-124.
- Discrete logarithm problem.
The Gaussian integer method (and sieving).
- R. Crandall and C. Pomerance, Prime Numbers: A Computational
Perspective, Springer-Verlag, 2001.
- Diffie-Hellman problem.
Towards the equivalence of the Diffie-Hellman and discrete logarithm
problems
- Diffie-Hellman problem.
Equivalence of the Diffie-Hellman and discrete logarithm problems
for elliptic curves
- DSA.
Attack on DSA
- Discrete log signature scheme.
- A critique of the random oracle model.
- Pairing-based cryptography.
- Pairing-based cryptography.
- D. Boneh, X. Boyen and H. Shacham,
Short
group signatures,
full version of paper that appeared in the Proceedings of
Crypto 2004.
- Pairing-based cryptography.