Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
Authors:
- 17 February 2003
- book chapter
- Published by Springer Nature
- p. 515-528
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Systematic design of original and modified Mastrovito multipliers for general irreducible polynomialsIEEE Transactions on Computers, 2001
- On the Importance of Eliminating Errors in Cryptographic ComputationsJournal of Cryptology, 2000
- Mastrovito multiplier for general irreducible polynomialsIEEE Transactions on Computers, 2000
- Fast arithmetic for public-key algorithms in Galois fields with composite exponentsIEEE Transactions on Computers, 1999
- Chinese Remaindering Based Cryptosystems in the Presence of FaultsJournal of Cryptology, 1999
- On-Line Error Detection for Bit-Serial Multipliers in GF(2m)Journal of Electronic Testing, 1998
- Efficient exponentiation of a primitive root in GF(2/sup m/)IEEE Transactions on Computers, 1997
- Arithmetic operations in GF(2m)Journal of Cryptology, 1993