PROOF CHECKING THE RSA PUBLIC KEY ENCRYPTION ALGORITHM1
ROBERT S. BOYER and STROTHER J. MOORE , Department of Computer Sciences, University of Texas, Austin, TX 78712
Publisher Summary
This chapter highlights the concept of proof checking the RSA public key encryption algorithm. A formal mathematical proof is a finite sequence of formulas, each element of which is either an axiom or the result of applying one of a fixed set of mechanical rules to the previous formulas in the sequence. It is, thus, possible to write a computer program to check mechanically whether a given sequence is a formal proof. However, formal proofs are rarely used. The theorem-prover deals with a quantifier free first order logic providing equality, recursively ...
Get Readings in Artificial Intelligence and Software Engineering now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
