Pages that link to "Item:Q1854276"
From MaRDI portal
The following pages link to Function field sieve method for discrete logarithms over finite fields (Q1854276):
Displaying 20 items.
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Updating key size estimations for pairings (Q2010589) (← 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)
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs (Q2409015) (← links)
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
- On the signature calculus for finite fields of order square of prime numbers (Q2436760) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← 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)
- Selecting polynomials for the Function Field Sieve (Q5501157) (← links)
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)