On the quantum security of high-dimensional RSA protocol
From MaRDI portal
Cites work
- A decade of lattice cryptography
- A hierarchy of polynomial time lattice basis reduction algorithms
- Advanced Topics in Computional Number Theory
- Algebraically structured LWE. Revisited
- Better key sizes (and attacks) for LWE-based encryption
- Characterizing overstretched NTRU attacks
- Efficient public key encryption based on ideal lattices (extended abstract)
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 611919 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of lattice problems with polynomial approximation factors
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- Problems in Algebraic Number Theory
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- The general sieve kernel and new records in lattice reduction
This page was built for publication: On the quantum security of high-dimensional RSA protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657369)
