Quoth George:
>>The full text is available at the PTO.
[Ed note: it is possible to retrieve the images
without the plug-in, if you "Use the Source, Luke"]
>>As I understand it, in essence it's pretty much
equivalent to the old idea of using a real random number
generator to make a OTP, then sen
On 28 Feb 2002 at 12:39, Sunder wrote:
> So it's
>
> while(...)
> {
> r=rng(); // read block from the rng
> p=plaintext(); // read block of plaintext
> c1=cypher1(plaintext,key1); // encrypt plaintext
> c2=c1 ^ r; // xor c1 with rng block
> c3=cypher2(r,key2);
On Thu, 28 Feb 2002, Morlock Elloi wrote:
> As for PRNGs, if you can exchange million bits securely, the desired
> unicity distance (based on your paranoia level) will determine how often
> you must re-key.
Given system lifetime of a decade, and the rate of traffic (clearly a TBps
router leaks m
> A question: assuming, you have a class of random number generators with
> lots of internal state. (Lots: like >>10^6 bits). Let's say the evolution
> through state space of that generator is provably reversible (or nearly
> reversible), and that the Hamiltonian of the system is stochastic (syste
A question: assuming, you have a class of random number generators with
lots of internal state. (Lots: like >>10^6 bits). Let's say the evolution
through state space of that generator is provably reversible (or nearly
reversible), and that the Hamiltonian of the system is stochastic (system
evolut
Cipher mixer with random number generator
Abstract
An encryption device has a random number generator whose output is
combined by exclusive-or with plaintext input which has been encrypted
by a first block cipher. The combined exclusive-or o
