The Rabin-Monier theorem for Lucas pseudoprimes-Reference-Cited by-同舟云学术

The Rabin-Monier theorem for Lucas pseudoprimes

Published:1997 Issue:218 Volume:66 Page:869-881
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Arnault F.

Abstract

We give bounds on the number of pairs ( P , Q ) (P,Q) with 0 ≤ P , Q > n 0\le P,Q>n such that a composite number n n is a strong Lucas pseudoprime with respect to the parameters ( P , Q ) (P,Q) .

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1997-66-218/S0025-5718-97-00836-3/S0025-5718-97-00836-3.pdf

Reference10 articles.

1. Rabin-Miller primality test: composite numbers which pass it;Arnault, F.;Math. Comp.,1995

2. \bysame, Constructing Carmichael numbers which are strong pseudoprimes to several bases, J. Symbolic Comput. 20 (1995), 151–161.

3. F. Arnault and G. Robin, Sur une fonction associée aux entiers quadratiques, Preprint.

4. Lucas pseudoprimes;Baillie, Robert;Math. Comp.,1980

5. On strong pseudoprimes to several bases;Jaeschke, Gerhard;Math. Comp.,1993

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Average case error estimates of the strong Lucas test;Designs, Codes and Cryptography;2024-01-18

2. Strengthening the Baillie-PSW primality test;Mathematics of Computation;2021-03-22

3. A Performant, Misuse-Resistant API for Primality Testing;Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security;2020-10-30

4. Prime and Prejudice;Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security;2018-01-15

5. Prime Numbers;Unsolved Problems in Number Theory;2004