On computing multiplicative inverses in GF(2/sup m/)
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (8) , 1010-1015
- https://doi.org/10.1109/12.238496
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Systolic array implementation of multipliers for finite fields GF(2/sup m/)IEEE Transactions on Circuits and Systems, 1991
- An implementation for a fast public-key cryptosystemJournal of Cryptology, 1991
- A VLSI architecture for fast inversion in GF(2/sup m/)IEEE Transactions on Computers, 1989
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard basesIEEE Transactions on Computers, 1988
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- Systolic VLSI Arrays for Polynomial GCD ComputationIEEE Transactions on Computers, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976