Back to Results
First PageMeta Content
Finite fields / Group theory / Logarithms / Cryptography / Computational complexity theory / Time complexity / Polynomial / General number field sieve / Field extension / Abstract algebra / Mathematics / Algebra


A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Emmanuel Thomé1 1
Add to Reading List

Document Date: 2013-12-16 04:03:37


Open Document

File Size: 460,66 KB

Share Result on Facebook

City

Paris / /

Country

France / /

Currency

pence / /

Facility

University of Lorraine / /

IndustryTerm

logarithm algorithm / bilinear polynomial systems / exponential algorithm / e-smooth / heuristic algorithm / basis algorithms / quasi-polynomial algorithm / matrix multiplication algorithms / /

Organization

University of Lorraine / /

Person

Razvan Barbulescu / Pierrick Gaudry / Emmanuel Thomé / Antoine Joux / /

Position

Prime Minister / Chair / France Cryptology / /

Product

Bang & Olufsen Form 2 Headphone/Headset / /

Technology

logarithm algorithm / heuristic algorithm / Function Field Sieve algorithm / quasi-polynomial algorithm / cryptography / 2 The algorithm / DLP / exponential algorithm / public key / previously known algorithm / 4 Main algorithm / PohligHellman algorithm / matrix multiplication algorithms / Gröbner basis algorithms / DLP algorithms / /

SocialTag