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

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


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
) 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.

Download full-text


Available from: Chiou-Yng Lee, Oct 06, 2015
33 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a low error and power optimized architecture for the multiplier based on multiplexers that aims for an optimized truncated product and power. The design of efficient truncation scheme with minimum truncation error and low power multiplier is essential for VLSI implementation of Signal Processing Devices. Various conventional array and parallel multipliers have been used and many of them boost the speed of the device at the cost of large VLSI area and high power dissipation. A novel design for multiplier based on multiplexer has been proposed in this paper considering the existing multiplexer based architecture. The proposed low error and power optimized multiplexer based truncated Multiplier was implemented in HSPICE environment in TSMC 180 nm library technology files. The results obtained are tabulated in the simulation result section, and it is observed that the proposed truncated multiplier architecture consumes approximately 35% reduction in dynamic power with minimum error. It also reduces the number of transistors by 37% when compared to the existing multiplexer based multiplier the conventional multiplexer based multiplier for 8 × 8 bit multiplication operation.
    IET Chennai 3rd International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2012); 01/2012
  • [Show abstract] [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
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Fault-tolerant design of a finite field multiplier is an efficient method for resisting fault-based cryptanalysis in Elliptic curve cryptosystems. A novel fault-tolerant bit-parallel Gaussian normal basis (GNB) multiplier with type-t over GF(2m), which can tolerate multiple module failures at one time, is presented. No hardware modification in the proposed GNB multiplier is required to achieve the fault-tolerant function. Hence, the proposed fault-tolerant GNB multiplier has low hardware cost. The reliability of the proposed fault-tolerant GNB multiplier with type-t increases as t increases. However, the behaviour of existing GNB multipliers with concurrent error correction (CEC) resembles triple modular redundancy (TRM) when t>;3. In practice, most of suggested m>;s by NIST use GNB with type-t>;3. The proposed fault-tolerant GNB multiplier is an N-modular redundancy (NMR) system with N>;t. Thus, the proposed fault-tolerant GNB multiplier with type-t can tolerate at most t/2-1 failed modules simultaneously, while existing GNB multipliers with CEC only can tolerate one failed module. The proposed GNB multiplier requires less extra space and time complexities than similar multipliers. System reliability of the proposed fault-tolerant GNB multiplier is better than that of similar GNB multipliers.
    IET Information Security 09/2012; 6(3):157-170. DOI:10.1049/iet-ifs.2011.0190 · 0.75 Impact Factor