Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order (Q2505361)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order |
scientific article |
Statements
Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order (English)
0 references
4 October 2006
0 references
We discuss the expected number of steps in solving multi-discrete logarithm problems over a group of elliptic curves with prime order by using Pollard's rho method and parallel collision search algorithm. We prove that when using these algorithms to compute discrete logarithms, the knowledge gained through computing many logarithms does not make it easier for finding other logarithms. Hence in an elliptic cryptosystem, it is safe for many users to share the same curve, with different private keys.
0 references
Pollard's rho method
0 references
parallel collision search algorithm
0 references
distinguished point
0 references
