Discrete logarithm variants of VSH

Arjen Lenstra, Daniel Page, Martijn Stam

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

4 Citations (Scopus)

Abstract

Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors introduce VSH-DL, a design based on exponentiation in DLP-based groups. In this article we explore a variant of VSH-DL that is based on cyclotomic subgroups of finite fields; we show that one can trade-off performance against bandwidth by using known techniques in such groups. Further, we investigate a variant of VSH-DL based on elliptic curves and and extract a tighter reduction to the underlying DLP in comparison to the original VSH-DL proposal.
Translated title of the contributionDiscrete logarithm variants of VSH
Original languageEnglish
Title of host publicationVietcrypt
PublisherSpringer Berlin Heidelberg
Pages229-242
Volume4341
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Discrete logarithm variants of VSH'. Together they form a unique fingerprint.

  • Cite this

    Lenstra, A., Page, D., & Stam, M. (2006). Discrete logarithm variants of VSH. In Vietcrypt (Vol. 4341, pp. 229-242). Springer Berlin Heidelberg.