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

March 6, 2021

Written by: [Algorand Foundation](https://algorand.co/blog/author/algorand-foundation)

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.](https://www.researchgate.net/publication/355492387_Practical_Post-quantum_Few-Time_Verifiable_Random_Function_with_Applications_to_Algorand)

### Algorand has led the industry in post-quantum security since 2022. And now, we've revealed a clear roadmap to achieving broad quantum resilience by 2027. Secure today. Ready for tomorrow.
