Cryptology ePrint Archive: Report 2021/446

Towards practical GGM-based PRF from (Module-)Learning-with-Rounding

Chitchanok Chuengsatiansup and Damien Stehle

Abstract: We investigate the efficiency of a (module-)LWR-based PRF built using the GGM design. Our construction enjoys the security proof of the GGM construction and the (module-)LWR hardness assumption which is believed to be post-quantum secure. We propose GGM-based PRFs from PRGs with larger ratio of output to input. This reduces the number of PRG invocations which improves the PRF performance and reduces the security loss in the GGM security reduction. Our construction bridges the gap between practical and provably secure PRFs. We demonstrate the efficiency of our construction by providing parameters achieving at least 128-bit post-quantum security and optimized implementations utilizing AVX2 vector instructions. Our PRF requires, on average, only 39.4 cycles per output byte.

Category / Keywords: foundations / pseudorandom function, (module-)learning-with-rounding, post-quantum security, efficient implementation, Karatsuba multiplication

Original Publication (in the same form): SAC 2019

Date: received 6 Apr 2021

Contact author: chitchanok chuengsatiansup at ens-lyon org

Available format(s): PDF | BibTeX Citation

Version: 20210408:122141 (All versions of this report)

Short URL: ia.cr/2021/446


[ Cryptology ePrint archive ]