On the combined fermat/lucas probable prime test

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1746, Issue , 1999, Pages 222-235

  Müller, Siguna ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

HIGH CONFIDENCE; LOW COSTS; MODULAR EXPONENTIATION; PRIME TEST; PSEUDOPRIMES; RECURSIONS; SOFTWARE AND HARDWARES;

PETROLEUM RESERVOIR EVALUATION;

EID: 34948815890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46665-7_26     Document Type: Conference Paper

References (19)

1. Arnault, F.: Rabin-Miller primality test: Composite numbers which pass it. Math. Comp. 64 (209), 355-361 (1995)
2. Baillie, R., Wagstaff, S., Jr.: Lucas pseudoprimes. Math. Comp. 35, 1391-1417 (1980)
3. Bleichenbacher, D.: Efficiency and Security of Cryptosystems based on Number Theory. Dissertation ETH Zurich 1996.
4. Carmichael, R.D.: On Sequences of Integers Defined by Recurrence Relations. Quart. J. Pure Appl. Math. Vol. 48, 343-372 (1920)
5. Grantham, J.: A Probable Prime Test with High Confidence. J. Number Theory 72, 32-47 (1998)
6. Guillaume, D., Morain, F.: Building pseudoprimes with a large number of prime factors. AAECC 7 (4), 263-277 (1996)
7. Jaeschke, G.: On strong pseudoprimes to several bases. Math. Comp. 61, 915-926 (1993)
8. Kowol, G.: On strong Dickson pseudoprimes. AAECC 3, 129-138 (1992)
9. Lidl, R., Muller, W.B., Oswald, A.: Some remarks on strong Fibonacci pseudoprimes. AAECC 1, 59-65 (1990)
10. More, W.: The LD Probable Prime Test. In: Mullin, R.C., Mullen, G. (eds.) Contemporary Mathematics 225, 185-191 (1999)
11. Muller, S.: On Strong Lucas Pseudoprimes. In: Dorninger, D., Eigenthaler, G., Kaiser, H.K., Kautschitsch, H., More, W., Muller, W.B. (eds.) Contribution to General Algebra, 10, 237-249 (1998).
12. Muller, S.: Carmichael Numbers and Lucas Tests. In: Mullin, R.C., Mullen, G. (eds.) Contemporary Mathematics 225, 193-202 (1999)
13. th International Conference on Fibonacci Numbers and Their Applications, June 22 - 26, 1998, Rochester, New York.
14. Muller, W.B., Oswald, A.: Dickson pseudoprimes and primality testing. In: Davies, D.W. (ed.) Advances in Cryptology - EUROCRYPT'91, 512-516. Lecture Notes in Computer Science, Vol. 547. Berlin Heidelberg New York: Springer 1991
15. 15. Math. Comp. 61, 381-391 (1993)
16. Pinch, R.G.E.: ftp://ftp.dpmms.cam.ac.uk/pub/rgep/Papers/publish.html#41
17. Postl, H.: Fast evaluation of Dickson polynomials. In: Dorninger, D., Eigenthaler, G., Kaiser H., Muller, W.B. (eds.) Contributions to General Algebra 6, 223-225. B. G. Teubner: Stuttgart 1988
18. Ribenboim, P.: The New Book of Prime Number Records. Berlin: Springer 1996
19. Somer, L.: On Lucas d-Pseudoprimes. In: Bergum, G., Philippou, A., Horadam, A. (eds.) Applications of Fibonacci Numbers, Vol. 7, Kluwer, 369-375 (1998)