scientific article; zbMATH DE number 1273657

MaRDI QIDQ4237387zbMATH OpenFDO

Authors Volker Müller, Johannes Buchmann

Publication date 20 July 1999

zbMATH Keywords

efficient algorithmselliptic curvespointspublic key cryptography

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05) Cryptography (94A60)

Recommendations

• Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
• Counting points on elliptic curves over finite fields
• Counting the number of points on elliptic curves over finite fields: strategies and performances
• Counting points on hyperelliptic curves over finite fields
• Counting points on elliptic curves
• Computing S-integral points on elliptic curves
• Computing integral points on elliptic curves
• scientific article; zbMATH DE number 2086874
• Computing all S-integral points on elliptic curves

Cited in

(23)

• Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm
• Some computational problems of cryptographic significance concerning elliptic curves over rings
• Counting points on elliptic curves over finite fields
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• Computing the \ell -power torsion of an elliptic curve over a finite field
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• CM-curves with good cryptographic properties
• Counting the number of points on elliptic curves over finite fields: strategies and performances
• Efficient implementation of Schoof's algorithm
• Subtleties in the Distribution of the Numbers of Points on Elliptic Curves Over a Finite Prime Field
• ECC: Do we need to count?
• Algorithm and program to determine the order of a point on an elliptic curve
• scientific article; zbMATH DE number 2154267 (Why is no real title available?)
• scientific article; zbMATH DE number 2086905 (Why is no real title available?)
• scientific article; zbMATH DE number 1860727 (Why is no real title available?)
• Efficient implementation of Schoof's algorithm in case of characteristic 2
• On the product of small Elkies primes
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Computation of ATR Darmon Points on Nongeometrically Modular Elliptic Curves
• How the Number of Points of An Elliptic Curve Over a Fixed Prime Field Varies
• Computing the order of points on an elliptic curve modulo N is as difficult as factoring N
• Elliptic curves over finite fields with Fibonacci numbers of points

This page was built for publication:

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