http://deadhacker.com/2006/02/21/sha-1-illustrated/ research repository of cyphunk://nathan.fain Fri, 19 Feb 2010 21:04:45 +0000 http://wordpress.com/ hourly 1 http://deadhacker.com/2006/02/21/sha-1-illustrated/#comment-3 how many blogs before I empty out? » Blog Archive » Formal aspects of mobile code security - Chapter 5 Wed, 22 Feb 2006 11:11:55 +0000 http://cyphunk.wordpress.com/2006/02/21/sha-1-illustrated/#comment-3 [...] What is a Fixed Point Attack? A Fixed Point Attack involves finding a random block whose properties allow the attacker to insert the block into the original message without changing the final hash. As a result two different messages are created with the same hash (the original message and the original+the special block). To produce this special block first make note of all the internal hash states produced after each block is compressed (see: SHA-1 Illustrated). Next generate random blocks (Xi) until you find one that meets two properties: [...] [...] What is a Fixed Point Attack? A Fixed Point Attack involves finding a random block whose properties allow the attacker to insert the block into the original message without changing the final hash. As a result two different messages are created with the same hash (the original message and the original+the special block). To produce this special block first make note of all the internal hash states produced after each block is compressed (see: SHA-1 Illustrated). Next generate random blocks (Xi) until you find one that meets two properties: [...]

]]>