VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Cryptography and data security
Cryptography and data security
Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/)
IEEE Transactions on Computers - Special issue on computer arithmetic
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)
IEEE Transactions on Computers
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
New Systolic Arrays for C + AB2, Inversion, and Division in GF(2m)
IEEE Transactions on Computers
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis
IEEE Transactions on Computers
On Computing Multiplicative Inverses in GF(2/sup m/)
IEEE Transactions on Computers
A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2/sup m/)
IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation
IEEE Transactions on Computers
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Architectures for Arithmetic over GF(2^m)
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Systolic architectures for inversion/division using AB2 circuits in GF(2m)
Integration, the VLSI Journal
Efficient scalable VLSI architecture for Montgomery inversion in GF(p)
Integration, the VLSI Journal
Low Complexity Word-Level Sequential Normal Basis Multipliers
IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Low-complexity versatile finite field multiplier in normal basis
EURASIP Journal on Applied Signal Processing
Parallel Itoh---Tsujii multiplicative inversion algorithm for a special class of trinomials
Designs, Codes and Cryptography
New stream ciphers based on elliptic curve point multiplication
Computer Communications
Implementation and analysis of stream ciphers based on the elliptic curves
Computers and Electrical Engineering
Fast arithmetic architectures for public-key algorithms over Galois fields GF((2n)m)
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Concurrent error detection architectures for field multiplication using gaussian normal basis
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
| Hi-index | 15.01 |
A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.