Server and Client Analogy – The New Cryptography Model

Alice writes an encryption program first of all. She then writes a
corresponding decryption program that checks her previous encryption
work. She tweaks these to perfection and then calls this joint
combination of encryption and decryption programs her ‘server’ that
she now sends to Bob. In future she will communicate with Bob by
sending him markup code as cipher text that will index her server
(functioning now as an interpreter program) and Bob’s computer then
becomes his browser that displays the message that Alice wants him to
know. This is a figurative model of what exists already as up-and-
running working ciphers in my computer.

The arrays of Alice’s base interpreter program can be made as large as
she likes so that the number of workable permutations of the order of
the elements is literally out of this world in magnitude. The
particular permutation that she initially sends to any Bob however is
unique to that Bob and is simply one only element of this vast set.
She can periodically refresh her ‘interpreter’ to this Bob by
occasionally sending him external scrambling and slicing parameters
that he must immediately apply to her particular server that is in his
sole custody. In all her dealings with this Bob it is this same base
that is being scrambled and sliced all the time. A different Bob
would have had a different base interpreter sent to him initially so
that the parameters of different messages (cross-channels) are useless
if the cipher text of different messages are illegally intercepted by
an adversary.

Despite its obvious transparency and ease of understanding, this
cryptography is still very intellectually challenging in that Alice
must design her markup creation methods so that each item of markup is
a standalone unit i.e. a totally independent member of the entire
larger set of markup being sent as cipher text. It must be impossible
for her to accidentally give unwanted structure to the markup data she
is calling cipher text. This crypto-type might be called implicit
cipher text as distinct from the ‘hard’ embedded cipher text of
modern methods.

Recapping, each Bob has a vast number of scrambled permutations of
interpreter that comprise his unique database or interpreter and these
are created by external scrambling of the arrays that comprise his
particular database. He is not allowed to change the database per se
internally, on his own however. (in essence he uses permutations of a
single permutation that has been uniquely assigned to him as parent

There are at least 1 billion permutations of database available for
every person on planet Earth who may become a Bob.

Networks of other Bobs are created by internal scrambling i.e.
internal trans-positional scrambling of the parent database arrays of
elements by Alice that will create a new unique database for every new
distinct Bob, he too will later scramble and slice these arrays
externally on instructions from Alice alone, in his dealings with her
within that dedicated closed loop. Again he may not change the parent
database internally but may scramble it from the outside according to
occasional parameters that are sent to him by Alice.

There’s a whole compendium of working ciphers to hand that are up and
running as demonstrable proof of the feasibility of this new
cryptography, these ciphers use both vector and scalar methods to
create the markup for use as cipher text by Alice.

Current cryptography uses the principle of embedded data encapsulated
within cipher text that must be secured by massive external complexity
so as to prevent it being stolen. This cryptography uses the
universal database of integers as the raw encryption data that
invariably leave unfortunate and indelibly sufficient, residual
structure in the cipher text for any cryptanalyst to say with
irrefutable certainty “there is structure there for the finding in
this cipher text”. He has access to the mathematics that will
identify this structure eventually and then it’s a simple equation,

Data + Structure = Information => the secrecy of the encryption is

I call this cryptography ‘complexity-theoretic’ cryptography for the
obvious reason that it depends on complexity alone. It is akin to
foolishly sending cash through the post. It is a long-running mistake
that started at the time of the inception of ASCII, the advent of
computers and the inception at the same time of number-theoretic
cryptography almost fifty years ago.

It has to be taken as virtually certain that quantum computers are
going to arrive some time in the next ten years and when that that
happens there will be no choice but to change to new crypto methods
like the one described here.

Current, complexity-theoretic cryptography is going down as the
longest running mistake in the history of mathematics - it is time for
the crypto establishment to admit this – then get real and most of all
- get honest and make changes! – Cheers - adacrypt.