On the properties of reduced basis related to lattice-reduced algorithm
From MaRDI portal
Publication:6585461
DOI10.47836/mjms.18.2.05MaRDI QIDQ6585461
N. Salleh, Hailiza Kamarulhaili
Publication date: 9 August 2024
Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The LLL algorithm. Survey and applications
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- The shortest vector in a lattice is hard to approximate to within some constant
- An Introduction to Mathematical Cryptography
- Mathematics of public key cryptography.
- A sieve algorithm for the shortest lattice vector problem
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
This page was built for publication: On the properties of reduced basis related to lattice-reduced algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585461)