Difference between revisions of "DHA-256"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) |
(→Others) |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
== Specification == | == Specification == | ||
| − | + | * digest size: 256 bits | |
| − | * digest size: | ||
* max. message length: < 2<sup>64</sup> bits | * max. message length: < 2<sup>64</sup> bits | ||
| − | * compression function: 512-bit message block, | + | * compression function: 512-bit message block, 256-bit chaining variable |
| − | * Specification: | + | <!-- |
| + | * Specification: http://csrc.nist.gov/groups/ST/hash/documents/ChangD_DHA256.pdf | ||
--> | --> | ||
| + | |||
| + | <bibtex> | ||
| + | @MISC{nistLeeCKLH05, | ||
| + | author = {Jesang Lee and Donghoon Chang and Hyun Kim and Eunjin Lee and Deukjo Hong}, | ||
| + | title = {A New 256-bit Hash Function DHA-256 - Enhancing the Security of SHA-256}, | ||
| + | howpublished = {NIST - First Cryptographic Hash Workshop, October 31-November 1}, | ||
| + | year = {2005}, | ||
| + | abstract = {DHA(Double Hash Algorithm)-256 is a dedicated hash function with message length of 512 bits and output length of 256 bits. ``Double'' means that each message word which is generated by the message expansion algorithm is used twice in a step. Our Design goal is to enhance the security of SHA-256. The step function and the message expansion of DHA-256 has almost same resource as SHA-256 but provides higher security bound against recent proposed attacks.}, | ||
| + | url = {http://csrc.nist.gov/groups/ST/hash/documents/ChangD_DHA256.pdf}, | ||
| + | } | ||
| + | </bibtex> | ||
== Cryptanalysis == | == Cryptanalysis == | ||
| Line 34: | Line 45: | ||
=== Others === | === Others === | ||
| + | <bibtex> | ||
| + | @misc{cryptoeprint:2005:398, | ||
| + | author = {IAIK Krypto Group}, | ||
| + | title = {Preliminary Analysis of DHA-256}, | ||
| + | howpublished = {Cryptology ePrint Archive, Report 2005/398}, | ||
| + | year = {2005}, | ||
| + | abstract = {DHA-256 was presented at the Cryptographic Hash Workshop hosted by NIST in November 2005. DHA-256 (Double Hash Algorithm) was proposed to enhance the security of SHA-256. We present a preliminary analysis of the message expansion and give an alternative 9-step local collision for DHA-256. }, | ||
| + | note = {\url{http://eprint.iacr.org/}}, | ||
| + | } | ||
| + | </bibtex> | ||
Latest revision as of 12:34, 3 November 2008
Contents
1 Specification
- digest size: 256 bits
- max. message length: < 264 bits
- compression function: 512-bit message block, 256-bit chaining variable
Jesang Lee, Donghoon Chang, Hyun Kim, Eunjin Lee, Deukjo Hong - A New 256-bit Hash Function DHA-256 - Enhancing the Security of SHA-256
- ,2005
- http://csrc.nist.gov/groups/ST/hash/documents/ChangD_DHA256.pdf
BibtexAuthor : Jesang Lee, Donghoon Chang, Hyun Kim, Eunjin Lee, Deukjo Hong
Title : A New 256-bit Hash Function DHA-256 - Enhancing the Security of SHA-256
In : -
Address :
Date : 2005
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
2.4 Second Preimage Attacks
2.5 Preimage Attacks
2.6 Others
IAIK Krypto Group - Preliminary Analysis of DHA-256
