Towards practical GGM-based PRF from (module-)learning-with-rounding

DOI10.1007/978-3-030-38471-5_28zbMATH Open1457.94114OpenAlexW2999338605MaRDI QIDQ778973FDOQ778973

Damien Stehlé, Chitchanok Chuengsatiansup

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-38471-5_28

Recommendations

• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Pseudorandom functions and lattices
• More efficient lattice PRFs from keyed pseudorandom synthesizers
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Pseudorandom functions in NC class from the standard LWE assumption

zbMATH Keywords

efficient implementationpseudorandom function(module-)learning-with-roundingKaratsuba multiplicationpost-quantum security

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: Towards practical GGM-based PRF from (module-)learning-with-rounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778973)