The following pages link to (Q4847920):
Displaying 23 items.
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
- Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- Levels of distribution for sieve problems in prehomogeneous vector spaces (Q2308337) (← links)
- On the signature calculus for finite fields of order square of prime numbers (Q2436760) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- (Q3615928) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Selecting polynomials for the Function Field Sieve (Q5501157) (← links)
- Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)
- New absolute irreducibility testing criteria and factorization of multivariate polynomials (Q6616847) (← links)