Multiplication over $\mathbb{F}_{{p}^{m}}$ on FPGA: A Survey
- 3 June 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- FPGA accelerated tate pairing based cryptosystems over binary fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Efficient Hardware Implementation of Finite Fields with Applications to CryptographyActa Applicandae Mathematicae, 2006
- Optimum Digit Serial GF(2^m) Multipliers for Curve-Based CryptographyIEEE Transactions on Computers, 2006
- Polynomial Basis Multiplication over GF(2 m )Acta Applicandae Mathematicae, 2006
- Efficient Hardware for the Tate Pairing Calculation in Characteristic ThreeLecture Notes in Computer Science, 2005
- Hardware Acceleration of the Tate Pairing in Characteristic ThreeLecture Notes in Computer Science, 2005
- Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption SchemesLecture Notes in Computer Science, 2004
- Efficient GF(p m ) Arithmetic Architectures for Cryptographic ApplicationsLecture Notes in Computer Science, 2003
- Low-Energy Digit-Serial/Parallel Finite Field MultipliersJournal of Signal Processing Systems, 1998