Defeating Simple Power Analysis on Koblitz Curves(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently. For this reason, they are suitable candidates for implementations on low-end processors. However, such devices are often vulnerable to side channel attacks. In this paper, we propose a new countermeasure against side channel attacks on Koblitz curves, which utilizes a fixed-pattern recoding to defeat simple power analysis. We show that in practical cases, the recoding can be performed from left to right, and can be easily stored or even randomly generated.
- 社団法人電子情報通信学会の論文
- 2006-05-01
著者
-
OKEYA Katsuyuki
Systems Development Laboratory, Hitachi Ltd.
-
VUILLAUME Camille
Systems Development Laboratory, Hitachi Ltd.
-
TAKAGI Tsuyoshi
Future University-Hakodate
-
Takagi Tsuyoshi
Future Univ.‐hakodate Hakodate‐shi Jpn
-
Okeya Katsuyuki
Systems Development Laboratory Hitachi Ltd.
-
Vuillaume Camille
Systems Development Laboratory Hitachi Ltd.
関連論文
- Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers
- Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
- Efficient Implementation of the Pairing on Mobilephones Using BREW
- Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers
- Generalized Powering Functions and Their Application to Digital Signatures(Digital Signature, Cryptography and Information Security)
- Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers
- Montgomery Multiplication with Twice the Bit-Length of Multipliers
- Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party
- Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
- Use of Montgomery Trick in Precomputation of Multi-Scalar Multiplication in Elliptic Curve Cryptosystems(Special Section on Cryptography and Information Security)
- SCA-Resistant and Fast Elliptic Scalar Multiplication Based on wNAF (Asymmetric Cipher) (Cryptography and Information Security)
- Defeating Simple Power Analysis on Koblitz Curves(Discrete Mathematics and Its Applications)
- Security Analysis of the SPA-Resistant Fractional Width Method(Elliptic Curve Cryptography, Cryptography and Information Security)
- Cryptanalysis of Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication(Discrete Mathematics and Its Applications)
- Side Channel Attacks against Hash-Based MACs with PGV Compression Functions
- On the Importance of Protecting Δ in SFLASH against Side Channel Attacks(Tamper-Resistance)(Cryptography and Information Security)
- A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems(Discrete Mathematics and Its Applications)
- Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
- A More Compact Representation of XTR Cryptosystem
- Efficient Hyperelliptic Curve Cryptosystems Using Theta Divisors(Elliptic Curve Cryptography, Cryptography and Information Security)
- Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
- Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
- Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
- Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
- Efficient Implementation of Pairing-Based Cryptography on a Sensor Node