Skip to content

Discrete logarithm variants of VSH

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Discrete logarithm variants of VSH. / Lenstra, Arjen; Page, Daniel; Stam, Martijn.

Vietcrypt. Vol. 4341 Springer Berlin Heidelberg, 2006. p. 229-242.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

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

APA

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

Vancouver

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

Author

Lenstra, Arjen ; Page, Daniel ; Stam, Martijn. / Discrete logarithm variants of VSH. Vietcrypt. Vol. 4341 Springer Berlin Heidelberg, 2006. pp. 229-242

Bibtex

@inproceedings{caf418001733447e8ebe3120fc1efafe,
title = "Discrete logarithm variants of VSH",
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.",
author = "Arjen Lenstra and Daniel Page and Martijn Stam",
year = "2006",
language = "English",
volume = "4341",
pages = "229--242",
booktitle = "Vietcrypt",
publisher = "Springer Berlin Heidelberg",
address = "Germany",

}

RIS - suitable for import to EndNote

TY - GEN

T1 - Discrete logarithm variants of VSH

AU - Lenstra, Arjen

AU - Page, Daniel

AU - Stam, Martijn

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

M3 - Conference contribution

VL - 4341

SP - 229

EP - 242

BT - Vietcrypt

PB - Springer Berlin Heidelberg

ER -