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

  • Authors:
  • Seigo Arita;Kazuto Matsuo;Koh-Ichi Nagao;Mahoro Shimura

  • Affiliations:
  • The authors are with Institute of Information Security, Yokohama-shi, 221-0835 Japan. E-mail:arita@iisec.ac.jp,;The authors are with Institute of Information Security, Yokohama-shi, 221-0835 Japan. E-mail:arita@iisec.ac.jp,;The author is with the Dept. of Engineering, Kanto-Gakuin Univ., Yokohama-shi, 236-8501 Japan.,;The author is with Chuo Univ. 21st Century Center of Excellence Program, Tokyo, 112-8551 Japan.

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a Weil descent attack against elliptic curve cryptosystems over quartic extension fields. The scenario of the attack is as follows: First, one reduces a DLP on a Weierstrass form over the quartic extention of a finite field k to a DLP on a special form, called Scholten form, over the same field. Second, one reduces the DLP on the Scholten form to a DLP on a genus two hyperelliptic curve over the quadratic extension of k. Then, one reduces the DLP on the hyperelliptic curve to one on a Cab model over k. Finally, one obtains the discrete-log of original DLP by applying the Gaudry method to the DLP on the Cab model. In order to carry out the scenario, this paper shows that many of elliptic curve discrete-log problems over quartic extension fields of odd characteristics are reduced to genus two hyperelliptic curve discrete-log problems over quadratic extension fields, and that almost all of the genus two hyperelliptic curve discrete-log problems over quadratic extension fields of odd characteristics come under Weil descent attack. This means that many of elliptic curve cryptosystems over quartic extension fields of odd characteristics can be attacked uniformly.