Pages that link to "Item:Q5746221"
From MaRDI portal
The following pages link to The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$ (Q5746221):
Displaying 14 items.
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
