Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems(Side Channel Analysis, <Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We discuss side channel leakage from modular reduction for NIST recommended domain parameters. FIPS 186-2 has 5 recommended prime fields. These primes have a special form which is referred to as generalized Mersenne prime. These special form primes facilitate especially efficient implementation. A typical implementation of efficient modular reduction with such primes includes conditional reduction. A conditional reduction in modular reduction can constitute an information channel on the secret exponent. Several researchers have produced unified code for elliptic point addition and doubling in order to avoid a simple power analysis (SPA). However, Walter showed that SPA still be possible if Montgomery multiplication with conditional reduction is implemented within the unified code. In this paper we show SPA on the modular reduction with NIST recommended primes, combining with the unified code for elliptic point operations. As Walter stated, our results also indicate that even if the unified codes are implemented for elliptic point operations, underlying field operations should be implemented in constant time. The unified approach in itself can not be a countermeasure for side channel attacks.
- 社団法人電子情報通信学会の論文
- 2006-01-01
著者
-
Sakai Yasuyuki
Mitsubishi Electric Corp. Kamakura‐shi Jpn
-
Sakurai Kouichi
Faculty Of Computer Science And Communication Engineering Kyushu University
-
SAKAI Yasuyuki
Information Technology R&D Center, Mitsubishi Electric Corporation
-
Sakai Yasuyuki
Information Technology R&d Center Mitsubishi Electric Corporation
関連論文
- A Collaborative Role-Based Access Control for Trusted Operating Systems in Distributed Environment(Application)(Cryptography and Information Security)
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider(Network Security)
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- A-7-21 Security Policy Pre-evaluation towards Risk Analysis
- Securing provenance by distributing the provenance storage (マルチメディア通信と分散処理・コンピュータセキュリティ)
- Use of Montgomery Trick in Precomputation of Multi-Scalar Multiplication in Elliptic Curve Cryptosystems(Special Section on Cryptography and Information Security)
- PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis(Symmetric Key Cryptography)(Cryptography and Information Security)
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- A Simple Power Attack on a Randomized Addition-Subtraction Chains Method for Elliptic Curve Cryptosystems
- Analysis and Design of SHA-V and RIPEMD-V with Variable Output-Length
- Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems(Side Channel Analysis, Cryptography and Information Security)
- On the Vulnerability of Exponent Recodings for the Exponentiation against Side Channel Attacks(Tamper-Resistance)(Cryptography and Information Security)
- Changes to Quantum Cryptography
- Enhancing Airport Access Control Security with Multiple Biometrics Contactless Smart Card (特集:新たな脅威に立ち向かうコンピュータセキュリティ技術)
- Timing Attacks against a Parallelized RSA Implementation (特集:プライバシを保護するコンピュータセキュリティ技術)
- An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider