| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Searching for messages conforming to arbitrary sets of conditions in SHA-256
Marko Hölbl, Christian Rechberger, Tatjana Welzer Družovec, 2008, independent scientific component part or a chapter in a monograph

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
Published in DKUM: 31.05.2012; Views: 1723; Downloads: 99
URL Link to full text

Search done in 0.04 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica