Round5: compact and fast post-quantum public-key encryption
From MaRDI portal
Publication:2302127
Recommendations
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Polar coding for ring-LWE-based public key encryption
- On the hardness of the computational ring-LWR problem and its applications
- Quantum resistant public key encryption scheme polarRLCE
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
Cited in
(13)- HILA5 pindakaas: on the CCA security of lattice-based encryption with error correction
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Rounding in the rings
- Lower bounds on lattice sieving and information set decoding
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Advances in Cryptology – CRYPTO 2004
- Polar coding for ring-LWE-based public key encryption
- Hardness of (M)LWE with semi-uniform seeds
- Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator
- A hybrid of lattice-reduction and Meet-LWE via near-collision on Babai's plane
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- On the combinatorial complexity of bounded sparse learning with errors (sLWE)
- LizarMong: excellent key encapsulation mechanism based on RLWE and RLWR
This page was built for publication: Round5: compact and fast post-quantum public-key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302127)