DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Function field sieve
Function field sieve
Sieve Algorithms for the Discrete Logarithm in Medium Characteristic Finite Fields Laurent Grémy
The Number Field Sieve for Discrete Logarithms
11.6 Discrete Logarithms Over Finite Fields
The Factoring Dead: Preparing for the Cryptopocalypse
USING NUMBER FIELDS to COMPUTE LOGARITHMS in FINITE FIELDS 1. Introduction Let Q = Pn, Where P Is a Prime Number and N a Positiv
Selecting Polynomials for the Function Field Sieve
The Impact of the Number Field Sieve on the Discrete Logarithm Problem In
The Tower Number Field Sieve
1 Introduction
Relation Collection for the Function Field Sieve
Mathematical Monographs
Function Field Sieve
LNCS 8383, Pp
This Is a Chapter from the Handbook of Applied Cryptography, by A
Chapter 3 Number-Theoretic Reference Problems
Book Pseudocode
24. Bibliography.Pdf (145.32KB)
Discrete Logarithm of to the Base , Denoted , Is the Unique Integer , Ö²IÒQÚ
Top View
The Discrete Logarithm Problem in Finite Fields of Small Characteristic
On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm
The Function Field Sieve Is Quite Special
SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
Faster Individual Discrete Logarithms in Finite Fields 3
References.Pdf
Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
The Tower Number Field Sieve Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
Computational Number Theory and Modern Cryptography Information Security Series
The Function Field Sieve
Polynomial Selection for the Number Field Sieve
Faster Individual Discrete Logarithms with the QPA and NFS Variants Aurore Guillevic
The Function Field Sieve in the Medium Prime Case
Function Field Sieve Method for Discrete Logarithms Over Finite Fields
On the Function Field Sieve and the Impact of Higher Splitting Probabilities⋆
Author Index
Selecting Polynomials for the Function Field Sieve
Cryptographic Primitives