http://blog.didierstevens.com/2007/05/21/hiding-inside-a-rainbow-part-2/ (blog 'DidierStevens) Tue, 16 Mar 2010 07:37:33 +0000 http://wordpress.com/ hourly 1 http://blog.didierstevens.com/2007/05/21/hiding-inside-a-rainbow-part-2/#comment-5494 www.andrewhay.ca » Suggested Blog Reading - Monday May 21st, 2007 Mon, 21 May 2007 12:16:46 +0000 http://didierstevens.wordpress.com/2007/05/21/hiding-inside-a-rainbow-part-2/#comment-5494 [...] Hiding Inside a Rainbow, Part 2 - Part Two in the series. In my previous post about steganography and rainbow tables, I explained a technique to hide data in a rainbow table. The disadvantage of this method is that there is a way, albeit costly, to detect the hidden data. This is because we replace the random bytes, that makeup the start of the chain, by the data we want to hide, thereby breaking the chain. A broken chain can be detected by recalculating the chain and comparing the recalculated hash with the stored hash. If they differ, the chain is broken. [...] [...] Hiding Inside a Rainbow, Part 2 – Part Two in the series. In my previous post about steganography and rainbow tables, I explained a technique to hide data in a rainbow table. The disadvantage of this method is that there is a way, albeit costly, to detect the hidden data. This is because we replace the random bytes, that makeup the start of the chain, by the data we want to hide, thereby breaking the chain. A broken chain can be detected by recalculating the chain and comparing the recalculated hash with the stored hash. If they differ, the chain is broken. [...]

]]>