Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
From MaRDI portal
(Redirected from Publication:6547909)
Cites work
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A thorough treatment of highly-efficient NTRU instantiations
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- BKZ 2.0: Better lattice security estimates
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of module-LWE with binary secret
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandom functions and lattices
- Revisiting the expected cost of solving uSVP and applications to LWE
- Round5: compact and fast post-quantum public-key encryption
- Secure integration of asymmetric and symmetric encryption schemes
This page was built for publication: Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547909)
