Bad witnesses for a composite number

DOI10.4064/AA230512-17-2MaRDI QIDQ6606883FDOQ6606883

Authors: Johnathan Djella Legnongo, Tony Ezome, Florian Luca 

Publication date: 17 September 2024

Published in: Acta Arithmetica (Search for Journal in Brave)

Recommendations

• A faster pseudo-primality test
• On the number of primality witnesses of composite integers
• On the Number of False Witnesses for a Composite Number
• scientific article; zbMATH DE number 721898
• Improved error bounds for the Fermat primality test on random inputs

zbMATH Keywords

Miller-Rabin testpseudoprime testbad witnessesGalois test

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• There are infinitely many Carmichael numbers
• Title not available (Why is that?)
• Four primality testing algorithms
• Title not available (Why is that?)
• Shifted primes without large prime factors
• Popular values of Euler's function
• Lucas Pseudoprimes
• Title not available (Why is that?)
• Frobenius pseudoprimes
• On the Number of False Witnesses for a Composite Number
• A faster pseudo-primality test
• Elliptic periods and primality proving
• On the normal number of prime factors of \(p - 1\) and some related problems concerning Euler's \(\varphi\)-function.
• Strengthening the Baillie-PSW primality test
• Average liar count for degree-\(2\) Frobenius pseudoprimes
• Некоторые критерии простоты чисел, связанные с малой теоремой Ферма

This page was built for publication: Bad witnesses for a composite number

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