On Implementation of GHS Attack against Elliptic Curve Cryptosystems over Cubic Extension Fields of Odd Characteristics

نویسندگان

  • Naoki Hashizume
  • Fumiyuki Momose
  • Jinhui Chao
چکیده

In this paper, we present algorithms for implementation of the GHS attack to Elliptic curve cryptosystems (ECC). In particular, we consider two large classes of elliptic curves over cubic extension fields of odd characteristics which have weak covering curves against GHS attack, whose existence have been shown recently [16][17][18]. We show an algorithm to find definition equation of the covering curve and an algorithm to transfer DLP of the elliptic curve to Jacobian of the covering curve. An algorithm to test if the covering curve is hyperelliptic is also shown in the appendix. keywords Elliptic curve cryptosystems, Discrete logarithm problem, GHS attack

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Weil Descent Attack against Elliptic Curve Cryptosystems over Quartic Extension Fields

This paper shows that many of elliptic curve cryptosystems over quartic extension fields of odd characteristics are reduced to genus two hyperelliptic curve cryptosystems over quadratic extension fields. Moreover, it shows that almost all of the genus two hyperelliptic curve cryptosystems over quadratic extension fields of odd characteristics come under Weil descent attack. This means that many...

متن کامل

On Security of Superelliptic Curves Based Cryptosystems against GHS Weil Descent Attacks

The GHS Weil descent attack by Gaudry, Hess and Smart was originally proposed to elliptic curves over finite fields of characteristic two [11]. Among a number of extensions of this attack, Diem treated the cases of hyperelliptic curves over finite fields of arbitrary odd characteristics [4]. His results were partially extended to algebraic curves of which the function fields are cyclic Galois e...

متن کامل

Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristic

In this paper, we present a classification of elliptic curves defined over a cubic extension of a finite field with odd characteristic which have coverings over the finite field therefore subjected to the GHS attack. The densities of these weak curves, with hyperelliptic and non-hyperelliptic coverings, are then analyzed respectively. In particular, we show, for elliptic curves defined by Legen...

متن کامل

Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristics

In this paper, we present a classification of classes of elliptic curves defined over cubic extension of finite fields with odd characteristics, which have coverings over the finite fields therefore can be attacked by the GHS attack. We then show the density of these weak curves with hyperelliptic and non-hyperelliptic coverings respectively. In particular, we shown for elliptic curves defined ...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2008  شماره 

صفحات  -

تاریخ انتشار 2008