Research Article Open Access

ERROR DETECTION SCHEMES FOR FINITE FIELD MULTIPLIERS

B. Sargunam1 and R. Dhanasekaran2
  • 1 Department of Electronics and Communication Engineering, Avinashilingam University, Coimbatore, India
  • 2 Syed Ammal Engineering College, Ramanathapuram, India

Abstract

Finite field multipliers are widely used in the field of cryptography for the purpose of scalar multiplication. The outputs of the finite field multipliers may consist of errors due to certain natural radiations which further leads to the failure of the cryptosystems. Here two Concurrent Error Detection (CED) schemes namely time redundancy and modular inversion based error detection schemes for finite field multipliers are discussed. The CED techniques have been implemented for bit serial, digit serial and bit parallel Montgomery multipliers. The Simulation results are obtained using Modelsim10.0b, area and power analysis has been performed using Xilinx ISE 9.1i. The proposed modular inversion based CED scheme is found to be area and power efficient compared to existing time redundancy based CED scheme.

American Journal of Applied Sciences
Volume 11 No. 1, 2014, 137-144

DOI: https://doi.org/10.3844/ajassp.2014.137.144

Submitted On: 16 September 2013 Published On: 11 December 2013

How to Cite: Sargunam, B. & Dhanasekaran, R. (2014). ERROR DETECTION SCHEMES FOR FINITE FIELD MULTIPLIERS. American Journal of Applied Sciences, 11(1), 137-144. https://doi.org/10.3844/ajassp.2014.137.144

  • 2,032 Views
  • 2,073 Downloads
  • 1 Citations

Download

Keywords

  • Montgomery Multiplication
  • Elliptic Curve Cryptography (ECC)
  • Parity Prediction
  • Modular Inversion
  • Finite Field Multipliers