| Title: | Searching for messages conforming to arbitrary sets of conditions in SHA-256 |
|---|
| Authors: | ID Hölbl, Marko (Author)
ID Rechberger, Christian (Author)
ID Welzer Družovec, Tatjana (Author) |
|---|
| Files: |  http://www.springerlink.com/content/v7711530n2651970/
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.16 - Independent Scientific Component Part or a Chapter in a Monograph |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As in other hash functions, differential collision search methods of SHA-256 can be described by means of conditions on and between state and message bits. We describe a tool for efficient automatic searching of message pairs conforming to useful sets of conditions, i. e. stemming from (interleaved) local collisions. We not only considerably improve upon previous work [7], but also show the extendability of our approach to larger sets of conditions. Furthermore, we present the performance results of an actual implementation and pose an open problem in this context. |
|---|
| Keywords: | hash functions analysis, messages, SHA-256, automatic searching, differential collision search |
|---|
| Year of publishing: | 2008 |
|---|
| PID: | 20.500.12556/DKUM-26282  |
|---|
| UDC: | 004.6 |
|---|
| COBISS.SI-ID: | 12666646 |
|---|
| NUK URN: | URN:SI:UM:DK:Z2YF0PQV |
|---|
| Publication date in DKUM: | 31.05.2012 |
|---|
| Views: | 1723 |
|---|
| Downloads: | 100 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
