VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases
IEEE Transactions on Computers
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
A VLSI Architecture for Fast Inversion in GF(2/sup m/)
IEEE Transactions on Computers
Exponetiation in Finite Fields Using Dual Basis Multiplier
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)
IEEE Transactions on Computers
IEEE Transactions on Computers
Double-Basis Multiplicative Inversion Over GF(2m)
IEEE Transactions on Computers
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
IEEE Transactions on Computers
Architectures and VLSI Implementations of the AES-Proposal Rijndael
IEEE Transactions on Computers
Exploration of Design Space in ECDSA
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
New Algorithm for Classical Modular Inverse
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
EDTC '97 Proceedings of the 1997 European conference on Design and Test
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
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
New Systolic Architectures for Inversion and Division in GF(2^m)
IEEE Transactions on Computers
High-Speed, Low-Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2^m)
IEEE Transactions on Computers
IEEE Transactions on Computers
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
Journal of Systems Architecture: the EUROMICRO Journal
Multi-segment GF(2m) multiplication and its application to elliptic curve cryptography
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Computers and Electrical Engineering
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm
MATH'05 Proceedings of the 7th WSEAS International Conference on Applied Mathematics
IEEE Transactions on Circuits and Systems II: Express Briefs
Speeding up Euclid's GCD algorithm with no magnitude comparisons
International Journal of Information and Computer Security
A compact and fast division architecture for a finite field GF(2m)
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Efficient hardware multiplicative inverters
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
High speed modular divider based on GCD algorithm
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Reducing cache power with low-cost, multi-bit error-correcting codes
Proceedings of the 37th annual international symposium on Computer architecture
A high-performance unified-field reconfigurable cryptographic processor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm
AEE'05 Proceedings of the 4th WSEAS international conference on Applications of electrical engineering
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
Energy-efficient cache design using variable-strength error-correcting codes
Proceedings of the 38th annual international symposium on Computer architecture
A novel arithmetic unit over GF(2m) for low cost cryptographic applications
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Performance of HECC coprocessors using inversion-free formulae
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Hardware-software co-design of AES on FPGA
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
| Hi-index | 15.01 |
The design of a modular standard basis inversion for Galois fields GF(2/sup m/) based on Euclid's algorithm for computing the greatest common divisor of two polynomials is presented. The asymptotic complexity is linear with m both in computation time and area requirement, thus resulting in an AT-complexity of O(m/sup 2/). This is a significant improvement over the best previous proposal which achieves AT-complexity of only O(m/sup 3/).