Article

Free access

Computing the number of points of elliptic curves over finite fields

Authors:

Johannes Buchmann,

Volker MüllerAuthors Info & Claims

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

Pages 179 - 182

https://doi.org/10.1145/120694.120718

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

L. Charlap, D. Robbins: An elementary introduction to elliptic curves, CRD Expository Report No. 31, Institude for Defense Analyses Princeton, December 1988

Google Scholar

[2]

L. Charlap, R. Coley, D. Robbins: Enumeration of Rational points on elliptic curves over finite fields, preprint

Google Scholar

[3]

D. HusemSller: Elliptic curves, Graduate texts in Mathematics 111, Springer-Verlag, 1987

Google Scholar

[4]

N. Koblitz: Elliptic curve cryptosystems, Mathematics of Computation, 48 (1987), 203-209

Crossref

Google Scholar

[5]

S. Lang: Elliptic Curves, Diophantine Analysis, Springer-Verlag, 1978

Google Scholar

[6]

J. van der Lingen: Elliptic curves and factorization, Report 87-2 (1987), University of Amsterdam

Google Scholar

[7]

K. Mehlhorn: Data Structures and Algorithms1: Sorting and Searching, Springer- Verlag, 1984

Google Scholar

[8]

V. Miller: Uses of elliptic curves in cryptography, Advances in Cryptology: Proceedings of Crypto '85, Lecture Notes in Computer Science, 218 (1986), Springer- Verlag, 417-426

Digital Library

Google Scholar

[9]

A. Odlyzko: Discrete logarithms and their cryptographic significance, Advances in Cryptology: Proceedings of Eurocrypt '84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag, 224-314

Digital Library

Google Scholar

[10]

C. Batut, D. Bernardi, H. Cohen, M. Olivier" User's guide to PARI-GP

Google Scholar

[11]

R. School: Elliptic curves over finite fields and the computation of square roots rood p, Mathematics of Computation, vol. 44, 1985, 483-494

Google Scholar

[12]

D. Shanks: Class number, A theory of factorization and genera, Proc. Sympos. Pure Math. vol.20, Amer. Math. Soc., 1970, 415- 44O

Google Scholar

[13]

D. Shanks: Five number theoretic algorithms, Congressus Numerantium No. VII, Proc. 2nd Manitoba Cone on Numerical Math., 1972, 51-70

Google Scholar

[14]

J. Silverman: The arithmetic of Elliptic Curves, Springer-Verlag, 1986

Crossref

Google Scholar

Cited By

View all

Lehmann FMaurer MMüller VShoup V(2005)Counting the number of points on elliptic curves over finite fields of characteristic greater than threeAlgorithmic Number Theory10.1007/3-540-58691-1_44(60-70)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58691-1_44
Couveignes JMorain F(2005)Schoof's algorithm and isogeny cyclesAlgorithmic Number Theory10.1007/3-540-58691-1_42(43-58)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58691-1_42
Maurer UWolf S(2000)The Diffie–Hellman ProtocolDesigns, Codes and Cryptography10.1023/A:100830212228619:2-3(147-171)Online publication date: 1-Mar-2000
https://dl.acm.org/doi/10.1023/A%3A1008302122286
Show More Cited By

Index Terms

Computing the number of points of elliptic curves over finite fields
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
      2. Number-theoretic computations

Recommendations

Constructing Hyperelliptic Covers for Elliptic Curves over Quadratic Extension Fields
Information Security and Privacy
Abstract
Elliptic curves and hyperelliptic curves over finite fields are of great interest in public key cryptography. Using much smaller field for same security makes the genus 2 curves more competitive than elliptic curves. However, point counting ...
Two-grid nonconforming finite element method for second order elliptic problems

In this paper, we present and analyze two-grid P₁ nonconforming finite element method for second order elliptic problems. The two-grid method involves solving one small origin problem on coarse grid with grid size H, and some correction problems on ...
A difference finite element method based on nonconforming finite element methods for 3D elliptic problems: A difference finite element method based on nonconforming finite...
Abstract
In this paper, a class of 3D elliptic equations is solved by using the combination of the finite difference method in one direction and nonconforming finite element methods in the other two directions. A finite-difference (FD) discretization based ... $_{}$ $_{}^{}$ $_{}^{}$ $^{}$ $_{}$ $_{}$ $_{}$

Comments

Information & Contributors

Information

Published In

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

June 1991

468 pages

ISBN:0897914376

DOI:10.1145/120694

Editor:
Stephen M. Watt

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC 91

Sponsor:

German Comp Soc
GMD
SIGSAM

ISSAC 91: International Symposium on Symbolic Algebraic Computation

July 15 - 17, 1991

Bonn, West Germany

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
640
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)14

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lehmann FMaurer MMüller VShoup V(2005)Counting the number of points on elliptic curves over finite fields of characteristic greater than threeAlgorithmic Number Theory10.1007/3-540-58691-1_44(60-70)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58691-1_44
Couveignes JMorain F(2005)Schoof's algorithm and isogeny cyclesAlgorithmic Number Theory10.1007/3-540-58691-1_42(43-58)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58691-1_42
Maurer UWolf S(2000)The Diffie–Hellman ProtocolDesigns, Codes and Cryptography10.1023/A:100830212228619:2-3(147-171)Online publication date: 1-Mar-2000
https://dl.acm.org/doi/10.1023/A%3A1008302122286
Miret JTena JValls M(2000)Elliptic Curves, Pythagorean Triples and ApplicationsCoding Theory, Cryptography and Related Areas10.1007/978-3-642-57189-3_17(184-194)Online publication date: 2000
https://doi.org/10.1007/978-3-642-57189-3_17
Menezes AVanstone SZuccherato R(1993)Counting points on elliptic curves over 𝐅_{2^{𝐦}}Mathematics of Computation10.1090/S0025-5718-1993-1153167-960:201(407-420)Online publication date: 1993
https://doi.org/10.1090/S0025-5718-1993-1153167-9

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Constructing Hyperelliptic Covers for Elliptic Curves over Quadratic Extension Fields

Two-grid nonconforming finite element method for second order elliptic problems

A difference finite element method based on nonconforming finite element methods for 3D elliptic problems: A difference finite element method based on nonconforming finite...