This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime
May 1986 (vol. 35 no. 5)
pp. 478-482
J.J. Thomas, Department of Research Engineering, Ven-Tel Inc.
The extended Euclidean algorithm is typically used to calculate multiplicative inverses over finite fields and rings of integers. The algorithm presented here has approximately the same number of average iterations and maximum number of iterations. It is shown, when P is a Mersenne prime, implementation of this algorithm on a processor, designed especially for mod P arithmetic operations, produces a more efficient algorithm with respect to the amount of program statements and number of operations. It is then shown heuristically, when the division and multiplications are performed simultaneously, the Euclidean algorithm has fewer subiterations.
Index Terms:
rings of integers, Euclid's algorithm, Fermat prime, finite fields, Mersenne prime, modulo P, multiplicative inverse, prime number
Citation:
J.J. Thomas, J.M. Keller, G.N. Larsen, "The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime," IEEE Transactions on Computers, vol. 35, no. 5, pp. 478-482, May 1986, doi:10.1109/TC.1986.1676791
Usage of this product signifies your acceptance of the Terms of Use.