| [1] | Berlekamp E R. Algebraic Coding Theory. New york: McGraw-Hill, 1968.[2]Brickell F F. A fast modular multiplication algorithm with application to two key cryptography, advances in cryptography. Proceedings of Crypto-82, New York: Plenum Press, 1983, 51-60.[3]Wang C C, Truong T K, Shao H M, Deutsch L J, Omura J K, Reed I S. VLSI architectures for computing multiplications and inverses in GF(2m)[J].IEEE Trans. on Computers.1985, C-34(8):709-716[4]徐大专.在GF(2m)上计算指数和逆.计算机学报,1990, 13(11): 860-863.[5]Itoh T, Tsujii S. Effective recursive algorithm for computing multiplicative inverses in GF(2m)[J].Electron. Lett.1988, 24(6):334-335[6]Asano Y, Itoh T, Tsujii S. Generalised fast algorithm for computing multiplicative inverses in GF(2m)[J].Electron. Lett.1989, 25(10):664-665 |