Verification of the Miller-Rabin probabilistic primality test.
From MaRDI portal
Publication:1400288
DOI10.1016/S1567-8326(02)00065-6zbMath1048.68051MaRDI QIDQ1400288
Publication date: 13 August 2003
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Related Items
Computational logic: its origins and applications, Multidimensional scaling and visualization of patterns in prime numbers, Proofs of randomized algorithms in Coq, Reasoning about conditional probabilities in a higher-order-logic theorem prover, Mechanisation of the AKS algorithm, Classification of finite fields with applications, Formal reliability and failure analysis of Ethernet based communication networks in a smart grid substation, Proof-producing translation of higher-order logic into pure and stateful ML
Uses Software
Cites Work
- Formal and efficient primality proofs by use of computer algebra oracles
- An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
- A formal proof of Sylow's theorem. An experiment in abstract algebra with Isabelle H0L
- Proof Checking the RSA Public Key Encryption Algorithm
- A Fast Monte-Carlo Test for Primality
- Factoring Polynomials Over Large Finite Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
