``Chinese & Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm

DOI10.1090/S0025-5718-00-01200-XzbMath1011.11080OpenAlexW2035415571MaRDI QIDQ2701567

Antoine Joux, Reynald Lercier

Publication date: 19 February 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01200-x

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (4)

Computing cardinalities of -curve reductions over finite fields ⋮ ON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACES ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Cryptanalysis of the binary permuted kernel problem

Cites Work

• Counting points on elliptic curves over finite fields
• Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ``Chinese & Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm