The Extended Euclidian Algorithm on Polynomials,and the Computational Efficiency of Hyperelliptic Cryptosystems

Authors:
Andreas Enge
Affiliations:
Lehrstuhl für Diskrete Mathematik, Optimierung und Operations Research, Universität Augsburg, 86135 Augsburg, Deutschland E-mail:enge@math.uni-augsburg.de
Venue:
Designs, Codes and Cryptography
Year:
2001

Citing 12
Cited 4

Hyperelliptic cryptosystems

Journal of Cryptology
Analysis of euclidean algorithms for polynomials over finite fields

Journal of Symbolic Computation
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Algebraic aspects of cryptography

Algebraic aspects of cryptography
Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

Mathematics of Computation
Computing discrete logarithms in real quadratic congruence function fields of large genus

Mathematics of Computation
Elliptic curves and their applications to cryptography: an introduction

Elliptic curves and their applications to cryptography: an introduction
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time

Mathematics of Computation
Proceedings of the First International Symposium on Algorithmic Number Theory

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory

Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time

Mathematics of Computation
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Speeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Supersingular Curves in Cryptography

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

After generalising two reduction algorithms tocharacteristic 2, we analyse the average complexity of thearithmetic in hyperelliptic Jacobians over any finite field.To this purpose we determine the exact average number offield operations for computing the greatest common divisor ofpolynomials over a finite field by the extended Euclidianalgorithm.