Pages that link to "Item:Q5939677"

The following pages link to The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems (Q5939677):

Displaying 4 items.

• Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications (Q541470) (← links)
• Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time (Q2781220) (← links)
• (Q3645716) (← links)
• The arithmetic of Jacobian groups of superelliptic cubics (Q4821055) (← links)