Showing 1–15 of 15 results
/ Date/ Name
May 13, 2009An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree CurvesOct 20, 2013Computation with No Memory, and Rearrangeable Multicast NetworksApr 8, 2016A modified block Lanczos algorithm with fewer vectorsDec 10, 2012Root optimization of polynomials in the number field sieveMay 19, 2013Computing class polynomials for abelian surfacesJan 25, 2007Time- and Space-Efficient Evaluation of Some Hypergeometric ConstantsJul 6, 2020Refined Analysis of the Asymptotic Complexity of the Number Field SieveMay 25, 2016Solving discrete logarithms on a 170-bit MNT curve by pairing reductionOct 10, 2016A kilobit hidden SNFS discrete logarithm computationJun 11, 2020Comparing the difficulty of factorization and discrete logarithm: a 240-digit experimentFeb 10, 2015Fast integer multiplication using generalized Fermat primesFeb 2, 2016Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse MatrixJun 18, 2013A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristicJul 23, 2014Isogeny graphs with maximal real multiplicationJul 4, 2015Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices