Page 32 - cdm-2014

sign up for a new account at the Xeoloomed Web site the characters used will (very likely) be
different. This won't matter because an enemy would still have to try every permutation of the
62^20.

Before I wrote my book I created an encryption system which had an infinite number of wrong
permutations and only one correct solution. It would have been impossible for anyone to have
programmed a computer to solve it. The system was easy to use and understand for the
average person if they could perform basic mathematics. It has to be efficient otherwise it would
be difficult to use and be sufficiently unpredictable to a computer so that a network of
supercomputers cannot be programmed to try all of the permutations. If I hadn't created such a
system first I would not have been able to write my book.

Let me go into more detail about my infinite algorithm. The algorithm is memorized by the user.
The data that the algorithm uses can be easily printed on sheets of paper. Each time the
algorithm is applied different parts of the data are used. So an attacker has to guess both the
algorithm and which data it is using at the time it is being used.

The data provides no clues as to the algorithm used. An attacker has no knowledge of how
much data is used each time the algorithm is applied and will have to guess when the algorithm
has finished.

I invented an ingenious and efficient method which tells the user where to obtain the data for
each round of the algorithm's application.

I just kept on refining it and refining it and refining it until I had the algorithm I wanted. The idea
is that an attacker has to guess from infinitely many algorithms as efficiently as possible. I won't
ever reveal it and it is proprietary. It took me a month to create.

There is no computer in this universe that can guess every algorithm out of an infinite possible
number. It would be like two aliens in another galaxy talking to each other. One asks the other,
'how invincible are you today?' You now have to guess how that was asked, in their language,
and they don't even use our alphabet.

In forming the algorithm I found that by using more data the number of permutations naturally
increased but that only works up to a point. Relying on it too much is the great danger because
the idea is to increase the efficiency rather than create an algorithm with many many finite
permutations that can be cracked by the combination of successful computer programming and
colossal computing power.

What happens if the algorithm is not efficient enough? This will result in an attacker having to
guess from a finite number of permutations rather than guessing one out of an infinite number of
algorithms. That is a huge, huge, huge difference. I want them to guess from an infinite number
of algorithms and I want them to do so as efficiently as possible. Period.

(So if I give you the sheets of paper with all of the characters/numbers printed on them you have
to guess how I'm using them.)

! " $ !
! # ! "