Verification of Euclid’s Algorithm for Finding Multiplicative Inverses


Multiplicative inverses have been widely used in cryptography. The basic method to find multiplicative inverses is to use Euclid’s Algorithm. When used for this purpose, several changes have to be made to the algorithm in order to make it more effective in finding these inverses. In this work, we use HOL-4 theorem prover to specify and verify Euclid’s… (More)