Lehmer-based algorithm for computing inverses in Galois fields GF(2/sup m/) |
| |
Authors: | Arguello F |
| |
Institution: | Dept. of Electron. & Comput. Sci., Univ. of Santiago, Santiago de Compostela, Spain; |
| |
Abstract: | An algorithm for computing multiplicative inverses in Galois fields GF(2/sup m/) is presented. It is based on Lehmer's algorithm for computing the greatest common divisor of two integers. The algorithm is designed to be advantageous for Galois fields of large size. |
| |
Keywords: | |
|
|