Article

# Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2m) Using Double Parity Prediction Scheme

(Impact Factor: 0.6). 02/2010; 58(2):233-246. DOI: 10.1007/s11265-009-0361-4
Source: DBLP

ABSTRACT

Successful implementation of elliptic curve cryptographic systems primarily depends on the efficient and reliable arithmetic
circuits for finite fields with very large orders. Thus, the robust encryption/decryption algorithms are elegantly needed.
Multiplication would be the most important finite field arithmetic operation. It is much more complex compared to the finite
field addition. It is also frequently used in performing point operations in elliptic curve groups. The hardware implementation
of a multiplication operation may require millions of logic gates and may thus lead to erroneous outputs. To obtain reliable
cryptographic applications, a novel concurrent error detection (CED) architecture to detect erroneous outputs in multiplexer-based
normal basis (NB) multiplier over GF(2
m
) using the parity prediction scheme is proposed in this article. Although various NB multipliers, depending on aa2i = åj = 0m - 1 ti,j a2j \alpha \alpha^{{2^i }} = \sum\limits_{j = 0}^{m - 1} {t_{i,j} } \alpha^{{2^j }} , have different time and space complexities, NB multipliers will have the same structure if they use a parity prediction
function. By using the structure of the proposed CED NB multiplier, a CED scalable multiplier over composite fields with 100%
error detection rate is also presented.

### Full-text

Available from: Chiou-Yng Lee,
• ##### Article: Self-checking alternating logic bit-parallel Gaussian normal basis multiplier with type-t
[Hide abstract]
ABSTRACT: This work develops a novel self-checking alternating logic (SCAL) bit-parallel Gaussian normal basis (GNB) multiplier with type-t over GF(2m). The proposed GNB multiplier is with both concurrent error-detection and off-line testing capabilities. The concurrent error-detection capability can give countermeasure to fault-based cryptanalysis. The off-line testing capability supports the design-for-test property. The proposed SCAL GNB multiplier can detect both permanent and transient faults. The proposed SCAL GNB is the first normal basis multiplier to have both on-line error-detection and off-line testing capabilities.
IET Information Security 04/2011; 5(1-5):33 - 42. DOI:10.1049/iet-ifs.2010.0254 · 0.75 Impact Factor
• Source
##### Article: Novel Optimal Normal Basis Multiplier with Even Type-t over GF(2^m) for On-Line Error Detection and Off-Line Test
[Hide abstract]
ABSTRACT: A novel semi-systolic Gaussian normal basis multiplier with even type-t is presented. The proposed multiplier requires only about 50% space complexity of existing similar multipliers. Based on the proposed multiplier, self-checking alternating logic design of such multiplier is developed for concurrent error detection and design-for-testability. The concurrent error detection capability is elegantly needed for resistance against faultbased attacks for elliptic curve cryptosystems. The design-for-testability capability is very important for VLSI chips for manufacturability and maintainability. Our proposed selfchecking alternating logic Gaussian normal basis multiplier is the first normal basis multiplier which can provide both on-line error detection capability and off-line easily testing property.
• ##### Conference Paper: Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach
[Hide abstract]
ABSTRACT: The elliptic curve cryptosystem is very attractive for the use in portable devices due to small key size. the finite field multiplication over GF(2m) is the most important arithmetic for performing the elliptic curve cryptosystem. Design of low cost finite field multiplier for elliptic curve cryptosystem is needed. the proposed self-checking alternating logic (SCAL) GNB multiplier using multiplexer approach is with both concurrent error detection and off-line testing capabilities. the concurrent error detection capability can give countermeasure to fault-based cryptanalysis. the proposed SCAL GNB multiplier using multiplexer approach can save about 18% space complexity as compared to existing similar study.
Genetic and Evolutionary Computing (ICGEC), 2012 Sixth International Conference on; 01/2012