The following pages link to (Q3808150):
Displaying 25 items.
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- On the distribution in short intervals of integers having no large prime factor (Q1084440) (← links)
- Modifications to the number field sieve (Q1310453) (← links)
- Integers without large prime factors (Q1320524) (← links)
- Polylog depth circuits for integer factoring and discrete logarithms (Q1322462) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- On the discrete logarithm problem in class groups of curves (Q3081294) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Finding elliptic curves with a subgroup of prescribed size (Q3179510) (← links)
- A Rigorous Subexponential Algorithm For Computation of Class Groups (Q3480172) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- Comments on search procedures for primitive roots (Q4372647) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)
- Finding orientations of supersingular elliptic curves and quaternion orders (Q6632044) (← links)
