Counting Points on Elliptic Curves Over F 2 m

DOI10.2307/2153177zbMath0809.14045OpenAlexW4250594812MaRDI QIDQ4293980

Robert J. Zuccherato, Scott A. Vanstone, Alfred J. Menezes

Publication date: 10 July 1994

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

Full work available at URL: https://doi.org/10.2307/2153177

zbMATH Keywords

number of points on a curve over a finite field

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Rational points (14G05) Number-theoretic algorithms; complexity (11Y16) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Elliptic curves (14H52) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)

Related Items (8)

Counting points on elliptic curves over finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Remarks on the Schoof-Elkies-Atkin algorithm ⋮ How to compute modular exponentiation with large operators based on the right-to-left binary algorithm ⋮ Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm ⋮ Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 ⋮ Elliptic curve cryptosystems and their implementation

This page was built for publication: Counting Points on Elliptic Curves Over F 2 m