000215148 001__ 215148
000215148 005__ 20180317095041.0
000215148 037__ $$aPOST_TALK
000215148 245__ $$aA Tale of Two Quasi-Polynomial Algorithms
000215148 269__ $$a2015
000215148 260__ $$c2015
000215148 336__ $$aTalks
000215148 520__ $$aIn 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating with the first heuristic quasi-polynomial algorithm (QPA) due to Barbulescu, Gaudry, Joux and Thome, which built upon an approach due to Joux. In 2014 Granger, Kleinjung and Zumbragel devised a way to extend the original GGMZ approach, resulting in a completely new QPA which has some interesting properties; in particular in some families of fields one can rigorously prove the complexity. In this talk we review these developments and compare the two QPAs.
000215148 700__ $$0247766$$aGranger, Robert$$g242282
000215148 7112_ $$aUCD Algebra and Number Theory Seminar, 5th October 2015
000215148 8564_ $$s3692852$$uhttps://infoscience.epfl.ch/record/215148/files/UCD_visit_2015.pdf$$yn/a$$zn/a
000215148 909CO $$ooai:infoscience.tind.io:215148$$pIC$$ppresentation
000215148 909C0 $$0252286$$pLACAL$$xU11265
000215148 917Z8 $$x242282
000215148 917Z8 $$x242282
000215148 917Z8 $$x242282
000215148 937__ $$aEPFL-TALK-215148
000215148 973__ $$aEPFL
000215148 980__ $$aTALK