Gaudry's Variant against C_<ab> Curves
スポンサーリンク
概要
- 論文の詳細を見る
Gaudry has described a new algorithm(Gaudry's variant)for the discrete logarithm problem(DLP) in hyperelliptic curves. For a hyperelliptic curve of a small genus on a finite field GF(q), Gaudry's variant solves for the DLP in time O(q^<2+ε>). This paper shows that C_<ab> curves can be attacked with a modified form of Gaudry's variant and presents the timing results of such attack. However, Gaudry's variant cannot be effective in all of the C_<ab> curve cryptosystems. This paper also provides an example of a C_<ab> curve that is unassailable by Gaudry's variant.
- 一般社団法人電子情報通信学会の論文
- 2000-09-25
著者
関連論文
- An Adaptive Algorithm for Cascaded Notch Filter with Reduced Bias
- On the Necessity of Estimating the Transfer Level in an Allpass-FIR ADF by the Use of Lyapunov Criteria
- Construction of Secure C_ Curves Using Modular Curves
- Gaudry's Variant against C_ Curves