(Verifiable) Delay Functions from Lucas Sequences

ePrint Report: (Verifiable) Delay Functions from Lucas Sequences

Charlotte Hoffmann, Pavel Hubáček, Chethan Kamath, Tomáš Krňák

Lucas sequences are constant-recursive integer sequences with a long history of applications in cryptography, both in the design of cryptographic schemes and cryptanalysis. In this work, we study the sequential hardness of computing Lucas sequences over an RSA modulus.


First, we show that modular Lucas sequences are at least as sequentially hard as the classical delay function given by iterated modular squaring proposed by …

applications computing cryptanalysis cryptographic cryptography design eprint report functions history integer report rsa study work