Building pseudoprimes with a large number of prime factors

DOI10.1007/BF01195532zbMath0862.11005OpenAlexW2074613869MaRDI QIDQ1919698

Yanyan Li

Publication date: 10 October 1996

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195532

zbMATH Keywords

bibliographyLucas sequencesprimality testingelliptic pseudoprimessuperstrong Dickson pseudoprimesgenerating pseudoprimeslarge Carmichael numberslarge Williams pseudoprimes

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Primality (11Y11)

Related Items (2)

Building pseudoprimes with a large number of prime factors ⋮ Constructing Carmichael numbers through improved subset-product algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on strong Fibonacci pseudoprimes
• Larger Carmichael numbers
• On strong Dickson pseudoprimes
• There are infinitely many Carmichael numbers
• Building pseudoprimes with a large number of prime factors
• The Carmichael Numbers up to 10 15
• Carmichael's lambda function
• The Carmichael Numbers to 10 12
• On the Number of Elliptic Pseudoprimes
• A New Method for Producing Large Carmichael Numbers
• The Pseudoprimes to 25 ⋅10 9
• The Distribution of Lucas and Elliptic Pseudoprimes
• New Primality Criteria and Factorizations of 2 m ± 1
• On Numbers Analogous to the Carmichael Numbers
• On Euler’s totient function
• On Fermat’s simple theorem

This page was built for publication: Building pseudoprimes with a large number of prime factors