Pages that link to "Item:Q5738878"
From MaRDI portal
The following pages link to A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878):
Displaying 10 items.
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← 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)
- Subliminal Hash Channels (Q3294875) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
