Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm

DOI10.1134/S2070046611020075MaRDI QIDQ1760269zbMATH OpenOpenAlexFDO

Authors Maria Zelenova

Publication date 13 November 2012

Published in \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s2070046611020075

zbMATH Keywords

elliptic curvesbaby-step giant-step algorithmgroup exponentMestre's theoremorder counting

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• scientific article; zbMATH DE number 1273657
• A modification of Shanks' baby-step giant-step algorithm
• Counting points on elliptic curves over finite fields
• Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
• Counting Points on Elliptic Curves Over F 2 m

Cites work

• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1930503 (Why is no real title available?)
• scientific article; zbMATH DE number 2123741 (Why is no real title available?)
• Counting points on elliptic curves over finite fields
• Elliptic curves. Number theory and cryptography

Cited in

(2)

• Optimized baby step-giant step methods
• Algorithm and program to determine the order of a point on an elliptic curve

This page was built for publication: Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760269)