Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm

DOI10.3103/S1066369X08120062zbMath1157.94360OpenAlexW2068285720MaRDI QIDQ1006997

Eh. Yu. Lerner

Publication date: 26 March 2009

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x08120062

zbMATH Keywords

Miller-Rabin algorithmCarmichael numbersFermat's little theoremShor's algorithmstrong pseudoprime witnesses

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• There are infinitely many Carmichael numbers
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item