Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
From MaRDI portal
Publication:6547909
DOI10.1007/978-981-97-1238-0_14MaRDI QIDQ6547909
Suhri Kim, Hyuna Noh, Minju Lee, Eunmin Lee, Joohee Lee
Publication date: 31 May 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Unnamed Item
- Unnamed Item
- On the hardness of module-LWE with binary secret
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- Round5: compact and fast post-quantum public-key encryption
- Revisiting the expected cost of solving uSVP and applications to LWE
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- Lattice Signatures and Bimodal Gaussians
- Pseudorandom Functions and Lattices
- Lattice Signatures without Trapdoors
- BKZ 2.0: Better Lattice Security Estimates
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Secure integration of asymmetric and symmetric encryption schemes
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
- A thorough treatment of highly-efficient NTRU instantiations
This page was built for publication: Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
