From: David_A Wagner <daw@CS.Berkeley.EDU>
To: cypherpunks@toad.com
Message Hash: edd2c039de4377d6001f54e25e56fd935b862cf405581d2fc7a404a1f5ed2346
Message ID: <199509202353.QAA20322@guaymas.CS.Berkeley.EDU>
Reply To: N/A
UTC Datetime: 1995-09-21 00:18:06 UTC
Raw Date: Wed, 20 Sep 95 17:18:06 PDT
From: David_A Wagner <daw@CS.Berkeley.EDU>
Date: Wed, 20 Sep 95 17:18:06 PDT
To: cypherpunks@toad.com
Subject: Re: NYT on Netscape Crack
Message-ID: <199509202353.QAA20322@guaymas.CS.Berkeley.EDU>
MIME-Version: 1.0
Content-Type: text/plain
In article <9509201034.AA10521@prakinf.tu-ilmenau.de> you write:
> Is it a good idea to use different (unrelated!) seeded PRNG's for the
> challenge data (which can be seen by sniffing) and the masterkey (which
> should never leave out of client's memory?
No.
If the master key PRNG is poorly seeded, this is still exploitable:
for instance, there is a lot of redundancy in most plaintext, and
this can be used to check each candidate key value.
Just use a cryptographically secure PRNG seeded with enough entropy.
Return to September 1995
Return to “David_A Wagner <daw@CS.Berkeley.EDU>”
1995-09-21 (Wed, 20 Sep 95 17:18:06 PDT) - Re: NYT on Netscape Crack - David_A Wagner <daw@CS.Berkeley.EDU>