Re: Key Evolving Encryption
From: David Wagner (daw_at_taverner.cs.berkeley.edu)
Date: 10/30/04
 Previous message: John Savard: "Re: A Simple Encryption Mode that "Feels" Secure"
 In reply to: Aldar Chan: "Re: Key Evolving Encryption"
 Next in thread: Anton Stiglic: "Re: Key Evolving Encryption"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 30 Oct 2004 06:10:40 +0000 (UTC)
Aldar Chan wrote:
>I am working on extending the
>scheme to infinite N in a more efficient way (don't know if it's possible,
>say multiple trees).
That shouldn't be too hard. Generate an imbalanced binary tree
that is "bushy to the right" recursively as follows: Create a root.
Let the left child of the root be a complete binary tree of size 2^n.
Let the right child of the root be a copy of the same "bushy to the
right" tree.
Another way to explain it: Create a root, a right child, a right
child of that, etc., on to infinity going down the right spine of
the tree. Now hang a complete binary tree of size 2^n off to the
left of (as the left child of) each node on the right spine.
There are other constructions, but this should give you an example
of how to construct such an infinite tree.
 Previous message: John Savard: "Re: A Simple Encryption Mode that "Feels" Secure"
 In reply to: Aldar Chan: "Re: Key Evolving Encryption"
 Next in thread: Anton Stiglic: "Re: Key Evolving Encryption"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
