Some computational problems of cryptographic significance concerning elliptic curves over rings (Q1854282)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1853046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some computational problems of cryptographic significance concerning elliptic curves over rings |
scientific article; zbMATH DE number 1853046 |
Statements
Some computational problems of cryptographic significance concerning elliptic curves over rings (English)
0 references
14 January 2003
0 references
Two computational problems related to an elliptic curve \(E\) over a finite ring \(Z_n\) with \(n\) square-free are studied, namely computing the number of rational points of \(E\) and finding \(Q\) such that, for a given rational point \(P\), \(2Q= P\). Concerning the computational complexity, the two problems are equivalent to integer factoring.
0 references
0.8462819457054138
0 references
0.8326690196990967
0 references
0.8088484406471252
0 references
0.784908652305603
0 references
