On probable prime testing and the computation of square roots mod n

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

Volumn 1838, Issue , 2000, Pages 423-437

  Müller, Siguna ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

PRIME TEST; QUADRATIC RESIDUES; SQUARE ROOTS;

COMPUTATION THEORY;

EID: 84946848315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_27     Document Type: Conference Paper

References (18)

1. Arnault, F.: Rabin-Miller primality test: Composite numbers which pass it. Math. Comp. 64 (209), 355-361 (1995).
2. Baillie, R., Wagsta, S., Jr.: Lucas pseudoprimes. Math. Comp. 35, 1391-1417 (1980).
3. Bleichenbacher, D.: Efficiency and Security of Cryptosystems based on Number Theory. Dissertation ETH Zürich (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. Grantham, J.: Frobenius Pseudoprimes, preprint (1998).
7. Jaeschke, G.: On strong pseudoprimes to several bases. Math. Comp. 61, 915-926 (1993).
8. Koblitz, N.: A Course in Number Theory and Cryptography. Springer-Verlag (1994).
9. Menezes, A., Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, CRC Press (1996).
10. m-n) via Lucas chains, preprint.
11. More, W.: The LD Probable Prime Test. In: Mullin, R.C., Mullen, G. (eds.) Contemporary Mathematics 225, 185-191 (1999).
12. Müller, S.: On the Combined Fermat/Lucas Probable Prime Test. In: Walker, M. (ed.) Cryptography and Coding, pp. 222-235, Proceedings of the Seventh IMA Conference on Cryptography and Coding, December 20-22, 1999, Royal Agricultural College, Cirencester, UK, LNCS 1746, Springer - Verlag (1999).
13. Müller, 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).
14. Ribenboim, P.: The New Book of Prime Number Records. Berlin, Springer (1996).
15. Somer, L.: Periodicity Properties of kth Order Linear Recurrences with Irreducible Characteristic Polynomial Over a Finite Field, In: Finite Fields, Coding Theory and Advances in Communications and Computing, Gary L. Mullen and Peter JauShyong Shiue (eds.), Marcel Dekker Inc., 195-207 (1993).
16. Somer, L.: On Lucas d-Pseudoprimes. In: Bergum, G., Philippou, A., Horadam, A. (eds.) Applications of Fibonacci Numbers, Vol. 7, Kluwer, 369-375 (1998).
17. Joye M., Quisquater, J.J.: Efficient computation of full Lucas sequences, IEE Electronics Letters, 32.6, 537-538 (1996).
18. Williams, H.C.: Eduard Lucas and primality Testing, John Wiley & Sons (1998).