Metraipolis › archive › dc_5eb015e0c583
Counting points on elliptic curves — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T02:15:59.849Z
- SHA-256 of the archived text
347ea214be909d3fa17be760dfe3d6b54b88563341bac71fa833747714fc49b8- Stable URL of this page
https://metraipolis.com/documento/dc_5eb015e0c583
How to cite
Counting points on elliptic curves — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5eb015e0c583 (Metraipolis archive dc_5eb015e0c583, sha256 347ea214be909d3fa17be760dfe3d6b54b88563341bac71fa833747714fc49b8)
BibTeX
@misc{dc5eb015e0c583,
title = {Counting points on elliptic curves — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5eb015e0c583; sha256 347ea214be909d3fa17be760dfe3d6b54b88563341bac71fa833747714fc49b8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An important aspect in the study of elliptic curves is devising effective ways of counting points on the curve. There have been several approaches to do so, and the algorithms devised have proved to be useful tools in the study of various fields such as number theory, and more recently in cryptography and Digital Signature Authentication (See elliptic curve cryptography and elliptic curve DSA). While in number theory they have important consequences in the solving of Diophantine equations, with respect to cryptography, they enable us to make effective use of the difficulty of the discrete logarithm problem (DLP) for the group E ( F q ) {\displaystyle E(\mathbb {F} _{q})} , of elliptic curves over a finite field F q {\displaystyle \mathbb {F} _{q}} , where q = pk and p is a prime. The DLP, as it has come to be known, is a widely used approach to public key cryptography, and the difficulty in solving this problem determines the level of security of the cryptosystem. This article covers algorithms to count points on elliptic curves over fields of large characteristic, in particular p > 3. For curves over fields of small characteristic more efficient algorithms based on p-adic methods exist.
Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «digital signature»).
Fonte: Wikipedia in inglese, voce «Counting points on elliptic curves» — https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves
Wikidata Q5177153 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5177153
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Counting_points_on_elliptic_curves?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1192691994, consultata il 2026-10-06T02:15:21.462Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c01eb5877507c1644265b987a5aabf66c8ccb42829ee5a2b445a453e2741a338