Discrete logarithm variants of VSH

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 extract a tighter reduction to the underlying DLP in comparison to the original VSH-DL proposal


Published in:
Progress in Cryptology-VIETCRYPT 2006. First International Conference on Cryptology in Vietnam. Revised Selected Papers (Lecture Notes in Computer Science vol.4341), 229 - 42
Presented at:
Progress in Cryptology-VIETCRYPT 2006. First International Conference on Cryptology in Vietnam. Revised Selected Papers (Lecture Notes in Computer Science vol.4341), Berlin, Germany
Year:
2006
Keywords:
Laboratories:




 Record created 2010-06-25, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)