Presentation 1998/9/17
Polynomial time Algorithm for Discrete Logarithm Problem over Super-Anomalous Elliptic Curves
Noboru Kunihiro, Kenji Koyama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) First, we introduce "super-anomalous elliptic curves." Super-anomalous elliptic curves, defined over the ring Z/nZ(n=Π^k_p_i), have n points and have p_i points over F_ for all p_i. In particular, if n is a prime number, these curves are ordinary anomalous elliptic curves. Recently, efficient algorithms were proposed for solving a discrete logarithm problem over anomalous elliptic curves [5][6][7]. We prove that a "discrete logarithm problem over super-anomalous elliptic curves" can be solved in polynomial time without knowing prime factors of n.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curve / discrete logarthm problem / super-anomalous / integer factoring / polynomial time algorithm
Paper # ISEC98-29
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/9/17(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Polynomial time Algorithm for Discrete Logarithm Problem over Super-Anomalous Elliptic Curves
Sub Title (in English)
Keyword(1) elliptic curve
Keyword(2) discrete logarthm problem
Keyword(3) super-anomalous
Keyword(4) integer factoring
Keyword(5) polynomial time algorithm
1st Author's Name Noboru Kunihiro
1st Author's Affiliation NTT Communication Science Laboratories()
2nd Author's Name Kenji Koyama
2nd Author's Affiliation NTT Communication Science Laboratories
Date 1998/9/17
Paper # ISEC98-29
Volume (vol) vol.98
Number (no) 268
Page pp.pp.-
#Pages 7
Date of Issue