scientific article; zbMATH DE number 493094

MaRDI QIDQ4276337zbMATH OpenFDO

Authors François Morain

Publication date 23 July 1995

zbMATH Keywords

surveypseudoprimality testspublic key cryptosystemspseudoprimescomposite numbersprimality testing algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization; primality (11A51) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 575870
• Recent developments in primality testing
• scientific article; zbMATH DE number 2098064
• scientific article; zbMATH DE number 691479
• The Pseudoprimes to 25 ⋅10 9

Cited in

(14)

• scientific article; zbMATH DE number 2077510 (Why is no real title available?)
• Finding pseudoprimes
• There are infinitely many Perrin pseudoprimes
• The Pseudoprimes to 25 ⋅10 9
• Lots and lots of Perrin-type primality tests and their pseudo-primes
• On the Number of False Witnesses for a Composite Number
• Tabulating Pseudoprimes and Tabulating Liars
• A Note on Perrin Pseudoprimes
• Infinitely many Carmichael numbers for a modified Miller-Rabin prime test
• Finding Carmichael numbers
• Results and estimates on pseudopowers
• Two hundred conjectures and one hundred and fifty open problems on Fermat pseudoprimes. Collected papers
• scientific article; zbMATH DE number 6293184 (Why is no real title available?)
• scientific article; zbMATH DE number 2098064 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276337)