| Anyone see a reason why the digits of Pi wouldn't form an excellent
| public large (infinite, actually) string of random bits?
|
| There's even an efficient digit-extraction (a/k/a random access to
| fractional bits) formula, conveniently base 16:
| http://mathworld.wolfram.com/BBPFormula.html
From: [EMAIL PROTECTED]
Sent: Mar 21, 2006 9:58 AM
To: [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED], cryptography@metzdowd.com
Subject: Re: pipad, was Re: bounded storage model - why is R organized as
2-d array?
...
| Anyone see a reason why the digits of Pi wouldn't form an excellent
| public
Anyone see a reason why the digits of Pi wouldn't form an excellent
public large (infinite, actually) string of random bits?
There's even an efficient digit-extraction (a/k/a random access to
fractional bits) formula, conveniently base 16:
http://mathworld.wolfram.com/BBPFormula.html
I dub this
At 10:37 AM 3/9/2006, Chris Palmer wrote:
Right, but even though a 1.5GHz machine is a bit old (heh...) for a
workstation, my dinky little Linksys WRT54GC wireless AP still needs to
AES-encrypt a theoretical maximum of 54Mbps when I turn on WPA.
Unless you're using your Linksys for
- Original Message -
From: Travis H. [EMAIL PROTECTED]
To: cryptography@metzdowd.com
Subject: bounded storage model - why is R organized as 2-d array?
Date: Thu, 2 Mar 2006 23:06:41 -0600
Hey,
In Maurer's paper, which is the last link here on the following page,
he proposes
On Thu, 09 Mar 2006 02:10:58 -0500
[EMAIL PROTECTED] wrote:
This is very useful for encrypting things like video
streams without an expensive hardware cryptographic accelerator card.
I think you vastly overestimate how much hardware one needs to do
something like AES. I ran
dd
Hey,
In Maurer's paper, which is the last link here on the following page,
he proposes to use a public random pad to encrypt the plaintext
based on bits selected by a key. What I'm wondering is why he chose
the strange construction for encryption; namely, that he uses an
additive (mod 2) cipher
