---
res:
  bibo_abstract:
  - "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.\r\nFirst, we show that modular Lucas sequences
    are at least as sequentially hard as the classical delay function given by iterated
    modular squaring proposed by Rivest, Shamir, and Wagner (MIT Tech. Rep. 1996)
    in the context of time-lock puzzles. Moreover, there is no obvious reduction in
    the other direction, which suggests that the assumption of sequential hardness
    of modular Lucas sequences is strictly weaker than that of iterated modular squaring.
    In other words, the sequential hardness of modular Lucas sequences might hold
    even in the case of an algorithmic improvement violating the sequential hardness
    of iterated modular squaring.\r\nSecond, we demonstrate the feasibility of constructing
    practically-efficient verifiable delay functions based on the sequential hardness
    of modular Lucas sequences. Our construction builds on the work of Pietrzak (ITCS
    2019) by leveraging the intrinsic connection between the problem of computing
    modular Lucas sequences and exponentiation in an appropriate extension field.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Charlotte
      foaf_name: Hoffmann, Charlotte
      foaf_surname: Hoffmann
      foaf_workInfoHomepage: http://www.librecat.org/personId=0f78d746-dc7d-11ea-9b2f-83f92091afe7
    orcid: 0000-0003-2027-5549
  - foaf_Person:
      foaf_givenName: Pavel
      foaf_name: Hubáček, Pavel
      foaf_surname: Hubáček
  - foaf_Person:
      foaf_givenName: Chethan
      foaf_name: Kamath, Chethan
      foaf_surname: Kamath
  - foaf_Person:
      foaf_givenName: Tomáš
      foaf_name: Krňák, Tomáš
      foaf_surname: Krňák
  bibo_doi: 10.1007/978-3-031-48624-1_13
  bibo_volume: 14372
  dct_date: 2023^xs_gYear
  dct_identifier:
  - UT:001160733700013
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9783031486234
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: (Verifiable) delay functions from Lucas sequences@
...