Financial Cryptography and Data Security: Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand

This paper introduces the first practical post-quantum verifiable random function (VRF) that relies on well-known (module) lattice problems, namely Module-SIS and Module-LWE, and estimates the performance of the Algorand blockchain using their function. The result is that transaction speed can remain high on Algorand even with increased resources needed to run post-quantum, few-time verifiable random functions.

To read in full, click here.