Improving ECDLP computation in characteristic 2
From MaRDI portal
Recommendations
- Speeding up elliptic curve discrete logarithm computations with point halving
- Improving the parallelized Pollard lambda search on anomalous binary curves
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- On random walks for Pollard's rho method
- scientific article; zbMATH DE number 6488034
Cites work
- A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two
- Elliptic Curve Cryptosystems
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1186971 (Why is no real title available?)
- scientific article; zbMATH DE number 1504545 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
- On random walks for Pollard's rho method
- Parallel collision search with cryptanalytic applications
- Probability Distributions Related to Random Mappings
- Speeding up elliptic curve discrete logarithm computations with point halving
- The Arithmetic of Elliptic Curves
Cited in
(2)
This page was built for publication: Improving ECDLP computation in characteristic 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040425)