Proof Checking the RSA Public Key Encryption Algorithm

DOI10.2307/2322356MaRDI QIDQ3340195zbMATH OpenOpenAlexFDO

Authors Robert S. Boyer, J Strother Moore

Publication date 1984

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2322356

zbMATH Keywords

pigeon hole principleRSA encryptionFermat's theoreminvertibility of the public key encryption algorithm of Rivest, Shamir and Adleman

Mathematics Subject Classification ID

Cryptography (94A60) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 65248
• On using primes for public key encryption systems
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Some Public-Key Crypto-Functions as Intractable as Factorization
• A modification of the RSA public-key encryption procedure (Corresp.)

Cited in

(6)

• A theorem prover for a computational logic
• Verification of the Miller-Rabin probabilistic primality test.
• The problem of induction
• Fermat, Euler, Wilson -- three case studies in number theory
• The application of automated reasoning to questions in mathematics and logic
• Certifying RSA

This page was built for publication: Proof Checking the RSA Public Key Encryption Algorithm

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