Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
Author:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 177-193
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)Lecture Notes in Computer Science, 2012
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problemJournal of Symbolic Computation, 2009
- A double large prime variation for small genus hyperelliptic index calculusMathematics of Computation, 2006
- On the cubic sieve method for computing discrete logarithms over prime fieldsInternational Journal of Computer Mathematics, 2005
- Constructive and destructive facets of Weil descent on elliptic curvesJournal of Cryptology, 2002
- An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves2000
- Function Field Sieve Method for Discrete Logarithms over Finite FieldsInformation and Computation, 1999
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- Discrete logarithms inGF(p)Algorithmica, 1986
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984