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

First Page		Document Content
Date: 2013-12-16 04:03:37 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 Source URL: www.loria.fr Download Document from Source Website File Size: 460,66 KB Share Document on Facebook

	SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗ DeustoTech, University of Deusto DocID: 1v9SC - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits DocID: 1v8bH - View Document
	J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER Complexity control of HEVC encoders targeting real-time DocID: 1uq0O - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits DocID: 1umuY - View Document
	A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email: DocID: 1uaFl - View Document