VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
A VLSI Architecture for Fast Inversion in GF(2/sup m/)
IEEE Transactions on Computers
Discrete Applied Mathematics
VLSI design for exponentiation in GF(2n)
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Efficient circuits for multiplying in GF(2m) for certain values of m
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
IEEE Transactions on Computers - Special issue on computer arithmetic
On orders of optimal normal basis generators
Mathematics of Computation
IEEE Transactions on Computers
Algorithms for exponentiation in finite fields
Journal of Symbolic Computation
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract)
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Fast Multiplication in Finite Fields GF(2N)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
IEEE Transactions on Computers
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Comb Architectures for Finite Field Multiplication in F(2^m)
IEEE Transactions on Computers
Low complexity bit parallel multiplier for GF (2m) generated by equally-spaced trinomials
Information Processing Letters
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Concurrent error detection architectures for Gaussian normal basis multiplication over GF(2m)
Integration, the VLSI Journal
A bit-serial word-parallel finite field multiplier using redundant basis in F2M
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
A high-speed word level finite field multiplier in F2m using redundant representation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Novel algebraic structure for cyclic codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Modified sequential normal basis multipliers for type II optimal normal bases
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Redundant trinomials for finite fields of characteristic 2
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Robust finite field arithmetic for fault-tolerant public-key cryptography
FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
An Efficient Finite Field Multiplier Using Redundant Representation
ACM Transactions on Embedded Computing Systems (TECS)
Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
Journal of Signal Processing Systems
Information Processing Letters
| Hi-index | 14.99 |
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclotomic ring which has a basis with the elegant multiplicative structure of a cyclic group. One important feature of our architectures is that they provide area-time trade-offs which enable us to implement the multipliers in a partial-parallel/hybrid fashion. This hybrid architecture has great significance in its VLSI implementation in very large fields. The squaring operation using the redundant representation is simply a permutation of the coordinates. It is shown that, when there is an optimal normal basis, the proposed bit-serial and hybrid multiplier architectures have very low space complexity. Constant multiplication is also considered and is shown to have an advantage in using the redundant representation.