The following pages link to Emmanuel Thomé (Q697495):
Displaying 30 items.
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Index calculus in class groups of non-hyperelliptic curves of genus three (Q1021239) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Isogeny graphs with maximal real multiplication (Q2329281) (← links)
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
- Universal Security (Q2867253) (← links)
- Computing Class Polynomials for Abelian Surfaces (Q2875530) (← links)
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm (Q2958952) (← links)
- Computing theta functions in quasi-linear time in genus two and above (Q2971008) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- Mapping Computation with No Memory (Q3184759) (← links)
- A double large prime variation for small genus hyperelliptic index calculus (Q3420442) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms (Q3654628) (← links)
- (Q4474168) (← links)
- Fast integer multiplication using generalized Fermat primes (Q4612576) (← links)
- History of Cryptographic Key Sizes (Q5034413) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- (Q5301655) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- Faster Multiplication in GF(2)[x] (Q5387595) (← links)
- Discrete Logarithm in GF(2809) with FFS (Q5402973) (← links)
- (Q5413906) (← links)
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic (Q5418686) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- The Block Lanczos Algorithm (Q5888181) (← links)
