Breaking a cryptographic protocol with pseudoprimes

Lecture Notes in Computer Science

Volumn 3386, Issue , 2005, Pages 9-15

  Bleichenbacher, Daniel ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL LIBRARIES; GLOSSARIES; PARAMETER ESTIMATION;

FIXED SETS; PARAMETER CHECKS; PRIMALITY TESTS; PSEUDOPRIMES;

CRYPTOGRAPHY;

EID: 24144474629     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30580-4_2     Document Type: Conference Paper

References (11)

1. W. R. Alford, A. Granville, and C. Pomerance. On the difficulty of finding reliable witnesses. In Algorithmic number theory, volume 877 of Lecture Notes in Computer Science, pages 1-16, Berlin, 1994. Springer Verlag.
2. W. R. Alford, A. Granville, and C. Pomerance. There are infinitely many Carmichael numbers. Annals of Mathematics, 140(3):703-722, 1994.
3. F. Arnault. Rabin-Miller primality test: Composite numbers which pass it. Mathematics of Computation, 64(209): 355-361, Jan. 1995.
4. p-1 ≡ 1 mod P. American Math. Monthly, 19:22-27, 1912.
5. I. Damgård, P. Landrock, and C. Pomerance. Average case error estimates for the strong probable prime test. Mathematics of Computation, 61(203):177-194, 1993.
6. P. Erdös. On pseudoprimes and Carmichael numbers. Publ. Math. Debrecen, 4:201-206, 1956.
7. A. Korselt. Problème chinois. L'intermédiaire des mathématiciens, 6:142-143, 1899.
8. P. MacKenzie. Personal communications.
9. S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory, IT-24:106-110, Jan. 1978.
10. M. Rabin. Probabilistic algorithms for testing primality. J. Number Theory, 12:128-138, 1980.
11. T. Wu. SRP-6: Improvements and refinements to the secure remote password protocol. http://srp.stanford.edu/doc.html, Oct. 2002.