20.500.12556/DKUM-26282 Searching for messages conforming to arbitrary sets of conditions in SHA-256 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. hash functions analysis messages SHA-256 automatic searching differential collision search podatki sporočila avtomatsko iskanje true false false Angleški jezik Angleški jezik Neznano 2012-05-31 12:23:11 2012-05-31 12:23:11 2022-04-15 03:41:18 2024-01-03 03:24:15 2008 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.6 12666646 URN:SI:UM:DK:Z2YF0PQV http://www.springerlink.com/content/v7711530n2651970/ 1 https://dk.um.si/Dokument.php?lang=slv&id=35248 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0