The following pages link to Pierrick Gaudry (Q412198):
Displaying 50 items.
- Genus 2 point counting over prime fields (Q412199) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines (Q1011454) (← links)
- (Q1596366) (redirect page) (← links)
- Constructive and destructive facets of Weil descent on elliptic curves (Q1596367) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Belenios: a simple private and verifiable electronic voting system (Q2303376) (← links)
- Improved complexity bounds for counting points on hyperelliptic curves (Q2420634) (← links)
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
- (Q2739453) (← links)
- (Q2764529) (← links)
- A general framework for subexponential discrete logarithm algorithms (Q2781453) (← links)
- The Tower Number Field Sieve (Q2795965) (← links)
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
- Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm (Q2958977) (← links)
- Collecting relations for the number field sieve in (Q2971019) (← links)
- A Low-Area Yet Performant FPGA Implementation of Shabal (Q3084248) (← links)
- Counting Points on Genus 2 Curves with Real Multiplication (Q3102207) (← links)
- (Q3149670) (← links)
- (Q3374896) (← links)
- A double large prime variation for small genus hyperelliptic index calculus (Q3420442) (← links)
- Sub-cubic change of ordering for Gröbner basis (Q3452391) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 (Q4412806) (← links)
- (Q4474194) (← links)
- (Q4474273) (← links)
- (Q4502491) (← links)
- Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM (Q4567251) (← links)
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm (Q4651432) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- (Q4832276) (← links)
- (Q4981686) (← links)
- (Q5300105) (← links)
- (Q5301666) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307257) (← links)
- Faster Multiplication in GF(2)[x] (Q5387595) (← links)
- Discrete Logarithm in GF(2809) with FFS (Q5402973) (← links)
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic (Q5418686) (← links)
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves (Q5429402) (← links)
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372) (← links)
- Fast genus 2 arithmetic based on Theta functions (Q5443536) (← links)
- Algorithmic Number Theory (Q5465621) (← links)
- EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS (Q5483452) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Public Key Cryptography - PKC 2006 (Q5898958) (← links)
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication (Q6165852) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
