Internal state ambiguity, strongest encryption tool
- From: jt64@xxxxxxxx
- Date: 4 Mar 2007 05:14:56 -0800
Internal state ambiguity is possibly the strongest tool ever presented
to cryptography, because even if plain text or blocks is compromised
you can not use it for decrypt earlier blocks.
Let us say that you have an internal state ambiguity of 256 bits, this
of course easy can be done by using two internal streams that can be
downmixed to PRNG or used for an pseudorandom S-box.
When you actually study the output used for a simple XOR on plaintext
you will find out that the actual PRNG string used to XOR the
plaintext has ambiguity in relation to the algorithm that did create
the PRNG stream.
An ambiguity of 256 bits entropy leaves any cryptographer bamboozled,
it is not much he could do to find the internal states. And if he do
not can find out the internal states it makes further analyse useless,
because without the internal states it is not possible to find the
previous or next block to be encrypted. Further more they are not at
all at jeopardy to chosen, known plaintext attacks.
So now you know why they dissmiss my ciphers it leaves their
extrordinary skills and experience within math and the cryptographic
field pretty much useless.
One puzzling thing about ambiguity constructions is that they are
crazy easy to scale up to any keysize (entropy). And this they
actually hate.
So next time you are thinking of building a cipher, make an ambiguity
one.
And one thing some people will say that ambiguity ciphers is
impossible to decode or decrypt, keep in mind they say so to protect
their jobs. And if you find their arguments plausible you probably
should not build ambiguity ciphers in the first place. Because you do
not understand the principle, of expanding keyspaces.
There are two very nice approaches to expanding keyspaces that i use
probably there is a lot more, one is shuffle walks also known as
permutations paths the other one is reuse of decrypted plaintext that
is put thru a one way hash to create keymaterial, this approach use
offsets in a database to create the abiguity. The first one is a
simple XOR approach of permutation strings.
But take some time to think about ambiguity of internal state and
expanding keyspaces i think you will find it to be fruithfull. At
least i like the ideas because they are actually an extension to
Shannons ideas of diffusion (and something more), i think it was 20
years ago i read the book but his approach to cipher building is very
basic and clever. A very intelligent man indeed, and so are most
cryptographers that is why they do not like ambiguity of internal
states.
It is a mystery though that the ideas of ambiguity not more widely
used in cryptography, maybe cryptographers actually want ciphers to be
possible to analyse. That was not at all the idea of Shannon though,
at least not what i remember of them reading the book 20 years ago.
Analyse this...
Best regards Jonas Thörnvall
.
- Prev by Date: Re: The crazy encryption madmans codebook
- Next by Date: How to Decrypt this ?
- Previous by thread: Elliptic curve embedding degrees
- Next by thread: How to Decrypt this ?
- Index(es):