2016
DOI: 10.1007/978-3-662-49387-8_1
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields

Abstract: The elliptic curve discrete logarithm problem is one of the most important problems in cryptography. In recent years, several index calculus algorithms have been introduced for elliptic curves defined over extension fields, but the most important curves in practice, defined over prime fields, have so far appeared immune to these attacks. In this paper we formally generalize previous attacks from binary curves to prime curves. We study the efficiency of our algorithms with computer experiments and we discuss th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
26
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(27 citation statements)
references
References 16 publications
1
26
0
Order By: Relevance
“…p group should not have many small subgroups. In 2016 Petit, Kosters and Messeng [20] had proposed an algorithm that solves DLP in the groups of elliptic curve points defined over finite fields of large characteristic. This algorithm is based on the factor base algorithm.…”
Section: Condition 5 the F *mentioning
confidence: 99%
See 4 more Smart Citations
“…p group should not have many small subgroups. In 2016 Petit, Kosters and Messeng [20] had proposed an algorithm that solves DLP in the groups of elliptic curve points defined over finite fields of large characteristic. This algorithm is based on the factor base algorithm.…”
Section: Condition 5 the F *mentioning
confidence: 99%
“…Here we give a brief description of the algorithm proposed by Petit, Kosters and Messeng in [20] and prove Estimate. Here we denote by K the algebraic closure of a field K and by the expression "a ∈ R B" we mean "a is taken uniformly random from the set B".…”
Section: Appendices a Resistance To Petit-kosters-messeng Attackmentioning
confidence: 99%
See 3 more Smart Citations