Isochronous Ciphertext Completely Defeats Brute Force Programs.
- From: adacrypt <austin.obyrne@xxxxxxxxxxx>
- Date: Sun, 13 May 2012 02:09:33 -0700 (PDT)
Isochronous ciphertext means the individual items of ciphertext that
collectively form the ciphertext ‘string’ proper all have the *same*
frequency.
In my “Displacement Cryptography” that frequency is simply 1 – each
item of ciphertext is a physical vector that occurs only once ever.
It is impossible except on a very rare fortuitous occasion for a
ciphertext item to be repeated but if that ever happens it is
extremely difficult to detect and it would be of no value whatever to
an adversary should he find it. To be of any value it would have to be
repeated many hundreds and even thousands of times.
For two items of vector ciphertext to be identical i.e. repeated, they
must each have exactly the same coefficients of i, j, k. For this to
be of any use to a cryptanalyst in constructing a brute force program
this repetition would have to happen on a large scale and it simply
doesn’t do that, not even once usually.
Tests on sample files of 10000 and 50000 ciphertext items indicates
that it hasn’t happened even once in the encryption of those files.
The results of a test such as this of course cannot be extrapolated to
all other files of that same size but the indications are very, very
strong that repeats of ciphertext are so rare in a cipher that is
based on vector displacement theory that they will never be of any use
to a cryptanalyst who expects it to happen regularly to a useful
degree in constructing brute force programs.
This cryptography is unbreakable under these attacks,
1) Ciphertext direct attack – i.e. seeking to invert the encryption
algorithm by some mathematical inverting function.
2 ) Implicit attack on the ciphertext – i.e. looking for correlations
between plaintext and ciphertext by linear analysis and / or
differential analysis and / or common methods of numerical analysis.
3) Implicit attack on the ciphertext i.e. seeking to establish
standard frequency tables that might enable statistical mapping of the
ciphertext onto the plaintext it represents on a probabilistic basis –
brute force programs in other words.
Resorting to huge sample-files of ‘X’ megabytes of ciphertext is
futile to brute force cryptanalysts when the ciphertext is composed of
physical displacement vectors such as it is here – this ploy might
work with ‘scalar’ ciphertext but is a non-starter with ciphertext
that is based on vector theory.
- adacrypt
.
- Prev by Date: Re: A new cipher?
- Next by Date: Accreditation in Cryptology.
- Previous by thread: Re: Has it a name?
- Next by thread: Accreditation in Cryptology.
- Index(es):
Relevant Pages
|
