Verification of the Miller-Rabin probabilistic primality test.
type: Item
instance of: scholarly article
title: Verification of the Miller-Rabin probabilistic primality test.
zbMATH Open document ID: 1048.68051
DOI: 10.1016/S1567-8326(02)00065-6
author: Joe Hurd
published in: The Journal of Logic and Algebraic Programming
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 1963687
zbMATH Keywords: Formal verification
zbMATH Keywords: Random algorithms
zbMATH Keywords: Primality test
describes a project that uses: PVS
describes a project that uses: HOL
describes a project that uses: NQTHM
MaRDI profile type: Publication
cites work: Q3216717
cites work: Q2754029
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Proof Checking the RSA Public Key Encryption Algorithm
cites work: Formal and efficient primality proofs by use of computer algebra oracles
cites work: Q3619797
cites work: Q4790665
cites work: Q4484343
cites work: A formal proof of Sylow's theorem. An experiment in abstract algebra with Isabelle H0L
cites work: Q4398780
cites work: Q4140386
cites work: Q4164569
cites work: An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
cites work: A Fast Monte-Carlo Test for Primality
description: scientific article; zbMATH DE number 1963687