Extending Regev's quantum algorithm to elliptic curves
From MaRDI portal
Cites work
- A heuristic for boundedness of ranks of elliptic curves
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
- Additive combinatorics
- Algorithmic Number Theory
- Algorithms for the shortest and closest lattice vector problems
- An algorithm for solving the discrete log problem on hyperelliptic curves
- An efficient quantum factoring algorithm
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
- Arithmetic and geometry. Papers dedicated to I. R. Shafarevich on the occasion of his sixtieth birthday. Vol. I: Arithmetic
- Computing the Rank of Elliptic Curves over Number Fields
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Elliptic curve cryptosystems and their implementation
- Elliptic curves with large rank over function fields
- Extending Regev's factoring algorithm to compute discrete logarithms
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 3765126 (Why is no real title available?)
- scientific article; zbMATH DE number 176613 (Why is no real title available?)
- scientific article; zbMATH DE number 503248 (Why is no real title available?)
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- Implementing 2-descent for Jacobians of hyperelliptic curves
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Integer multiplication in time \(O(n\log n)\)
- On the difference of the Weil height and the Neron-Tate height
- On the Evaluation of Powers and Monomials
- On the quantum complexity of the continuous hidden subgroup problem
- Pairing-Friendly Elliptic Curves of Prime Order
- Public Key Cryptography - PKC 2006
- Ranks of elliptic curves
- Ranks of quadratic twists of elliptic curves
- Selected Areas in Cryptography
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Solving low-density subset sum problems
- Space-efficient and noise-robust quantum factoring
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Arithmetic of Elliptic Curves
- The average rank of elliptic curves. I. (With an appendix by Oisín McGuinness: The explicit formula for elliptic curves over function fields)
- The size of Selmer groups for the congruent number problem. II. With an appendix by P. Monsky.
- Twisted Edwards Curves
This page was built for publication: Extending Regev's quantum algorithm to elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856484)
