Efficient Multiplier Architectures for Galois Fields GF(24n)
IEEE Transactions on Computers
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
On-Line Error Detection for Bit-Serial Multipliers in GF(2m)
Journal of Electronic Testing: Theory and Applications
Mastrovito Multiplier for All Trinomials
IEEE Transactions on Computers
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier
IEEE Transactions on Computers
IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A New Low Complexity Parallel Multiplier for a Class of Finite Fields
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Parallel Multipliers Based on Special Irreducible Pentanomials
IEEE Transactions on Computers
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
IEEE Transactions on Computers
Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials
IEEE Transactions on Computers
Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m)
Journal of Electronic Testing: Theory and Applications
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
Journal of Electronic Testing: Theory and Applications
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
IEEE Transactions on Computers
C-testable bit parallel multipliers over GF(2m)
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Montgomery Residue Representation Fault-Tolerant Computation in GF(2k)
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Theory of Quantum Computation, Communication, and Cryptography
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
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
Hardware design and analysis of block cipher components
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Galois field hardware architectures for network coding
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)a
Quantum Information & Computation
Information Processing Letters
VLSI performance evaluation and analysis of systolic and semisystolic finite field multipliers
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
High-Speed hardware implementation of rainbow signature on FPGAs
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
An Efficient Finite Field Multiplier Using Redundant Representation
ACM Transactions on Embedded Computing Systems (TECS)
Integration, the VLSI Journal
Quantum binary field inversion: improved circuit depth via choice of basis representation
Quantum Information & Computation
New bit parallel multiplier with low space complexity for all irreducible trinomials over GF(2n)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient gröbner basis reductions for formal verification of galois field multipliers
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
Quantum Information & Computation
| Hi-index | 0.04 |