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

スポンサーリンク

概要

• 論文の詳細を見る

• 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(2^m) 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.

• 社団法人電子情報通信学会の論文
• 2006-02-01

著者

• Lee Chiou-yng

  The Department Of Computer Information And Network Engineering Lunghwa University Of Science And Tec

• Deng An-wen

  The Department Of Information Management Ching Yun University

• CHIOU Che-Wun

  the Department of Computer Science and Information Engineering, Ching Yun University

• LIN Jim-Min

  the Department of Information Engineering and Computer Science, Feng Chia University

• Lin Jim-min

  The Department Of Information Engineering And Computer Science Feng Chia University

• Chiou Che-wun

  The Department Of Computer Science And Information Engineering Ching Yun University

関連論文

• Concurrent Error Detection in Montgomery Multiplication over GF(2^m) (Information Security)

スポンサーリンク