The following pages link to Aurore Guillevic (Q1698672):
Displaying 14 items.
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm (Q2811129) (← links)
- Four-Dimensional GLV via the Weil Restriction (Q2867212) (← links)
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
- Efficient Multiplication in Finite Field Extensions of Degree 5 (Q3011913) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Improved Broadcast Encryption Scheme with Constant-Size Ciphertext (Q4912498) (← links)
- Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions (Q4912502) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
