Exponential sums and lattice reduction: Applications to cryptography
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1996491
- Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
- Lattice reduction: a toolbox for the cryptoanalyst
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Lattice reduction in cryptology: An update
Cited in
(10)- Security of polynomial transformations of the Diffie-Hellman key.
- New bounds on exponential sums related to the Diffie-Hellman distributions
- Classical simulation of quantum circuits by half Gauss sums
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
- Public-key cryptosystems from lattice reduction problems
- scientific article; zbMATH DE number 1996491 (Why is no real title available?)
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- A hidden number problem in small subgroups
- UNIFORM DISTRIBUTION, EXPONENTIAL SUMS, AND CRYPTOGRAPHY
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
This page was built for publication: Exponential sums and lattice reduction: Applications to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792315)