lkml.org 
[lkml]   [1997]   [Oct]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: monitoring entropy


On Wed, 15 Oct 1997, Ingo Molnar wrote:

> Now, hashes clearly more complex than a XOR, but is it proved that it
> cannot be inverted, even when we pass it _known_ text?
>
> lets call this phenomemon 'key aging'. Any key will age, since the
> information passed is never trully random, thus it can be predicted, and
> the key can be recovered if enough information is passed.

Then by reading lots you can only age the key quicker.. The key is
refreshed from real randomness (which you are prob generating by writing
you evil cracking data to the disk).. Even assuming it isn't refrshed you
still have to crach SHA..


\
 
 \ /
  Last update: 2005-03-22 13:40    [W:0.053 / U:5.332 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site