The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems

DOI10.1023/A:1011215802656zbMath0985.94031OpenAlexW1491854237MaRDI QIDQ5939677

Andreas Enge

Publication date: 4 November 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011215802656

zbMATH Keywords

average complexityEuclidean algorithmhyperelliptic cryptosystem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

The arithmetic of Jacobian groups of superelliptic cubics ⋮ Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time

This page was built for publication: The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems