Efficient Hyperelliptic Curve Cryptosystems Using Theta Divisors(Elliptic Curve Cryptography, <Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
It has recently been reported that the performance of hyperelliptic curve cryptosystems (HECC) is competitive to that of elliptic curve cryptosystems (ECC). Concerning the security of HECC, the theta divisors play an important role. The scalar multiplication using a random base point is vulnerable to an exceptional procedure attack, which is a kind of side-channel attacks, using theta divisors. In the case of cryptographic protocols of the scalar multiplication using fixed base point, however, the exceptional procedure attack is not applicable. First, we present novel efficient scalar multiplication using theta divisors, which is the positive application of theta divisors on HECC. Second, we develop a window-based method using theta divisors that is secure against side-channel attacks. It is not obvious how to construct a base point D such that all pre-computed points are theta divisors. We present an explicit algorithm for generating such divisors.
- 社団法人電子情報通信学会の論文
- 2006-01-01
著者
-
Takagi Tsuyoshi
Future Univ.‐hakodate Hakodate‐shi Jpn
-
Takagi Tsuyoshi
Future University - Hakodate
-
KATAGI Masanobu
Information Technologies Laboratories, Sony Corporation
-
AKISHITA Toru
Information Technologies Laboratories, Sony Corporation
-
KITAMURA Izuru
Information Technologies Laboratories, Sony Corporation
-
Akishita Toru
Information Technologies Laboratories Sony Corporation
-
Kitamura Izuru
Information Technologies Laboratories Sony Corporation
-
Katagi Masanobu
Information Technologies Laboratories Sony Corporation
関連論文
- Efficient Implementation of the Pairing on Mobilephones Using BREW
- Generalized Powering Functions and Their Application to Digital Signatures(Digital Signature, Cryptography and Information Security)
- Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party
- Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
- 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)
- 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)
- Zero-Value Register Attack on Elliptic Curve Cryptosystem(Tamper-Resistance)(Cryptography and Information Security)
- On the Optimal Parameter Choice for Elliptic Curve Crystosystem Using Isogeny(Tamper-Resistance)(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