Finite field for scientists and engineers
Finite field for scientists and engineers
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
Mastrovito Multiplier for All Trinomials
IEEE Transactions on Computers
IEEE Transactions on Computers
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Versatile and Scalable Digit-Serial/Parallel Multiplier Architecture for Finite Fields GF(2m)
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Parallel Multipliers Based on Special Irreducible Pentanomials
IEEE Transactions on Computers
FPGA Implementation of an Efficient Multiplier over Finite Fields GF(2^m)
RECONFIG '05 Proceedings of the 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05) on Reconfigurable Computing and FPGAs
LFSR multipliers over GF(2m) defined by all-one polynomial
Integration, the VLSI Journal
VLSID '07 Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems
Versatile multiplier architectures in GF(2k) fields using the Montgomery multiplication algorithm
Integration, the VLSI Journal
A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)
Computers & Mathematics with Applications
Improved throughput bit-serial multiplier for GF(2m) fields
Integration, the VLSI Journal
Efficient utilization of elliptic curve cryptosystem for hierarchical access control
Journal of Systems and Software
Low complexity digit serial systolic montgomery multipliers for special class of GF(2m)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-power and high-speed design of a versatile bit-serial multiplier in finite fields GF(2m)
Integration, the VLSI Journal
| Hi-index | 0.00 |
Heretofore many All-One-Polynomials (AOP) based multipliers are proposed over GF(2 m ). Previously proposed multipliers have serial input structure and also suffer from a long critical path delay. In this paper we improve AOP based multipliers by reducing the critical path delay and changing the input structure to parallel. Initially, we modify the wiring of the previously proposed AOP based multipliers. This approach reduces the critical path delay from O(m) to O(log m). In order to further reduce this delay from O(log m) to O(1) the pipeline technique is utilized. The efficiency of the proposed architectures is evaluated based on criteria of time (latency, critical path) and space complexity (gate-latch number).