Concurrent Error Detection in Montgomery Multiplication over GF(2m)

Authors:
Che-Wun Chiou;Chiou-Yng Lee;An-Wen Deng;Jim-Min Lin
Affiliations:
The author is with the Department of Computer Science and Information Engineering, Ching Yun University, Taiwan. E-mail: cwchiou@cyu.edu.tw,;The author is with the Department of Computer Information and Network Engineering, Lunghwa University of Science and Technology, Taiwan. E-mail: PP010@mail.lhu.edu.tw,;The author is with the Department of Information Management, Ching Yun University, Taiwan. E-mail: awdeng@cyu.edu.tw,;The author is with the Department of Information Engineering and Computer Science, Feng Chia University, Taiwan. E-mail: jimmy@fcu.edu.tw
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 6

Low-complexity bit-parallel systolic multipliers over GF(2m)

Integration, the VLSI Journal
The Optimal Architecture Design of Two-Dimension Matrix Multiplication Jumping Systolic Array

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Concurrent error detection architectures for Gaussian normal basis multiplication over GF(2m)

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

Journal of Signal Processing Systems
Concurrent error detection in bit-serial normal basis multiplication over GF(2m) using multiple parity prediction scheme's

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low latency systolic montgomery multiplier for finite field GF(2m) based on pentanomials

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because fault-based attacks on cryptosystems have been proven effective, fault diagnosis and tolerance in cryptography have started a new surge of research and development activity in the field of applied cryptography. Without magnitude comparisons, the Montgomery multiplication algorithm is very attractive and popular for Elliptic Curve Cryptosystems. This paper will design a Montgomery multiplier array with a bit-parallel architecture in GF(2m) with concurrent error detection capability to protect it against fault-based attacks. The robust Montgomery multiplier array with concurrent error detection requires only about 0.2% extra space overhead (if m = 512 is as an example) and requires four extra clock cycles compared to the original Montgomery multiplier array without concurrent error detection.