IEICE TRANSACTIONS on Fundamentals
Concurrent Error Detection in Montgomery Multiplication over GF(2m)
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.2 pp.566-574
- Publication Date
- 2006/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.2.566
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Che-Wun CHIOU, Chiou-Yng LEE, An-Wen DENG, Jim-Min LIN, "Concurrent Error Detection in Montgomery Multiplication over GF(2m)" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 2, pp. 566-574, February 2006, doi: 10.1093/ietfec/e89-a.2.566.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.2.566/_p
Copy
@ARTICLE{e89-a_2_566,
author={Che-Wun CHIOU, Chiou-Yng LEE, An-Wen DENG, Jim-Min LIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Concurrent Error Detection in Montgomery Multiplication over GF(2m)},
year={2006},
volume={E89-A},
number={2},
pages={566-574},
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.},
keywords={},
doi={10.1093/ietfec/e89-a.2.566},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Concurrent Error Detection in Montgomery Multiplication over GF(2m)
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 566
EP - 574
AU - Che-Wun CHIOU
AU - Chiou-Yng LEE
AU - An-Wen DENG
AU - Jim-Min LIN
PY - 2006
DO - 10.1093/ietfec/e89-a.2.566
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2006
AB - 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.
ER -
English
