Round5: compact and fast post-quantum public-key encryption

DOI10.1007/978-3-030-25510-7_5zbMath1475.94102OpenAlexW2961104175MaRDI QIDQ2302127

Scott Fluhrer, Markku-Juhani O. Saarinen, Ronald Rietman, Sauvik Bhattacharya, Zhenfei Zhang, Oscar Garcia-Morchon, Hayo Baan, Thijs Laarhoven, L. M. G. M. Tolhuizen

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25510-7_5

zbMATH Keywords

error correctionpublic-key encryptionlearning with roundingIND-CPAlattice cryptographyprime cyclotomic ring

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Lower bounds on lattice sieving and information set decoding ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Rounding in the rings