Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)

Fault-based cryptanalysis has been developed to effectively break both private-key and public-key cryptosystems, making robust finite field multiplication a very important research topic in recent years. However, no robust normal basis multiplier has been proposed in the literature. Therefore, this...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2009-06, Vol.58 (6), p.851-857
Main Authors: Chiou, C.W., Chang, C.-C., Lee, C.-Y., Hou, T.-W., Lin, J.-M.
Format: Article
Language:English
Subjects:
Breaking
Circuit faults
Complexity theory
concurrent error correction
concurrent error detection
Cryptography
Elliptic curve cryptography
elliptic curve cryptosystem
Error detection
fault-based cryptanalysis
Finite element methods
Finite field multiplication
Galois fields
Gaussian
Gaussian normal basis
Gaussian processes
Hardware
Mathematical analysis
Multiplication
Multipliers
Redundancy
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fault-based cryptanalysis has been developed to effectively break both private-key and public-key cryptosystems, making robust finite field multiplication a very important research topic in recent years. However, no robust normal basis multiplier has been proposed in the literature. Therefore, this investigation presents a semisystolic Gaussian normal basis multiplier. Based on the proposed Gaussian normal basis multiplier, both concurrent error detection and correction capabilities can be easily achieved using time redundancy technology with no hardware modification.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2008.226