Please use this identifier to cite or link to this item:
doi:10.22028/D291-25830
Title: | Distributed computation of the number of points on an elliptic curve over a finite prime field |
Author(s): | Buchmann, Johannes Müller, Volker Shoup, Victor |
Language: | English |
Year of Publication: | 1995 |
SWD key words: | Technische Informatik Kryptosystem |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | In this report we study the problem of counting the number of points on an elliptic curve over a finite prime field. This problem is not only very interesting for number theorists but has recently gained a lot of attention among cryptographers. Recently, there has been a lot of progress concerning the problem of computing this group order #E(Fp). The algorithm of Atkin-Elkies has been partially improved and implemented in Paris and Saarbrücken. In both implementations the algorithm is distributed over a network of workstations by means of the system sc LiPS which supports such distributions. The current record is the computation of the group order #E(Fp), where p is a 375-digit prime. That computation took approximately 1765 MIPS days. In this report we briefly describe the state of the art of counting points on elliptic curve over finite prime fields. We explain the main computational problems and their solution by means of distributed and parallel computation. , |
Link to this record: | urn:nbn:de:bsz:291-scidok-3916 hdl:20.500.11880/25886 http://dx.doi.org/10.22028/D291-25830 |
Date of registration: | 23-Jun-2005 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
sfb124-95-03.pdf | 135,5 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.