Name
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 extract a tighter reduction to the underlying DLP in comparison to the original VSH-DL proposal. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11958239_15 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
rsa-like modular exponentiation,original vsh-dl proposal,elliptic curve,discrete logarithm variant,provable security,finite field,design strategy,vsh hash function,standardised hash function,dlp-based group,cyclotomic subgroup,hash function,discrete logarithm,modular exponentiation,cryptography,standardisation | Discrete mathematics,Finite field,Computer science,Cryptography,Collision resistance,Arithmetic,Hash function,Exponentiation,Provable security,Modular exponentiation,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
4341 | 0302-9743 | 3-540-68799-8 |
Citations | PageRank | References |
5 | 0.51 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arjen K. Lenstra | 1 | 1641 | 237.68 |
| Daniel Page | 2 | 84 | 5.56 |
| Martijn Stam | 3 | 1659 | 67.36 |