Pages that link to "Item:Q5738876"

The following pages link to Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876):

Displaying 8 items.

• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
• Updating key size estimations for pairings (Q2010589) (← 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)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• A Brief History of Pairings (Q5267789) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)