Improvement of lattice-based cryptography using CRT
From MaRDI portal
Recommendations
- Optimizations for NTRU
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Hardware optimization and evaluation for crucial modules of lattice-based cryptography
- Computational aspects of lattices and their cryptographic applications
- Lattice attacks on NTRU and LWE: a history of refinements
Cites work
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- scientific article; zbMATH DE number 1418301 (Why is no real title available?)
- On Lovász' lattice reduction and the nearest lattice point problem
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
Cited in
(9)- Optimizations for NTRU
- Hardware optimization and evaluation for crucial modules of lattice-based cryptography
- Lattice attacks on NTRU and LWE: a history of refinements
- An upgrade on the key generation algorithm of the GGH-MKA lattice-based encryption scheme
- Enhanced cryptosystem \(AA_ \beta\) -- a comparative analysis
- AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
- PMNS for cryptography: a guided tour
- Improvements to RSA key generation and CRT on embedded devices
This page was built for publication: Improvement of lattice-based cryptography using CRT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064338)