Networking and Mutual Database Technology.
- From: adacrypt <austin.obyrne@xxxxxxxxxxx>
- Date: Thu, 21 Oct 2010 01:56:56 -0700 (PDT)
It is pretty certain now that my invention of mutual database
technology will ultimately take over completely from the current
encapsulation technology. The latter technology has a huge drawback
in that it involves a key transport problem that will never go away.
This means that the plaintext is implicitly embedded within the
ciphertext and no matter how intellectually intractable the entities
think it is to an illegal cryptanalyst, it is still there for the
finding by the same mathematical tools that were used to create it.
It will always be prone to being found, a parlous fact for both
national governments and commerce.
Mutual database technology literally puts the keys out of sight of the
cryptanalyst within the respective computer memories of Alice and Bob
and is unbreakably effective in obfuscating the information being
secured. The ciphertext then merely references the arrays of the
database at Bob’s end and gives the data the required structure that
turns it into information. Intercepting the ciphertext simply
provides useless data that means nothing to the adversary who does not
have access to the database that is privy to Alice and Bob alone. As
long as they keep their database private Alice and Bob can enjoy
perfect secrecy of communications for evermore.
Each secure communications loop in a network is made unique by giving
it a dedicated identity key, call it a digital signature if you wish.
This is achieved as follows.
Every pair of entities that comprise a single loop have at least one
random secure key-set in their database that is, in the case of ASCII
(being the smallest in Unicode), 95 elements in extent. Therefore,
there are 95! (95 factorial i.e > 2^ 490) permutations of the same
basic random key-set that are available as separate, unique identity
keys for the setting up of independent secure communications loops
worldwide. To create a new loop for a new Bob Alice merely assigns
one of these permutations as the identity key of the new loop. There
are enough keys available to provide a few million each to every human
being on this planet. Alice and Bob can change their unique, base
identity key set, by mutual arrangement at any time. This will always
the same one that they will then use to scramble and slice the arrays
of their database for individual message encryptions in day-to-day
working, until it is changed again.
It is possible in theory at least, for Alice and Bob to realise all of
the other random permutations of the entire key-space simply by going
through all of the possible ‘scramble and slice’ parameters that are
available to them and applying these to their own identity key set.
An impossible task in reality but it is there for the trying. Could
Eve not do this also might be a question? Yes, but the key-sets are
random and she would have the problem of equal probability of each of
the 95 elemental keys in any one set (all 2^490 of them) being equally
likely of being the next one to be called in what is to her, a blind
retrieval system. It would be futile for her to take that on.
There are many variations of this networking scheme for the choosing
by infrastructure managers, who by the way, do not need to be
Enjoy - adacrypt
- Prev by Date: Looking for Curve25519-based EC-KCDSA Implementation
- Next by Date: Re: A General Distinguisher
- Previous by thread: Looking for Curve25519-based EC-KCDSA Implementation
- Next by thread: In the Beginning.