KDE-Forum.org

The method of encryption of files random bytes is invented. At
encryption strings in length of 256 bytes consisting of all 256 bytes,
that is each byte will be used (and them only 256 - from 0 up to 255) meets equally once. Strings differ from each other a relative positioning bytes. In total such strings are included 8,5 x 10 in a degree 506. This number is monstrously great. For matching the amount of atoms in all our universe does not exceed 10 in a degree 81.
Apparently, for the first time the mankind will use Great infinity
in daily life. For decryption of files it is necessary to enumerate and
arrange all strings. However even if each string will be remembered with one atom atoms in all universe will not suffice for storage of all strings.
We live in the physical world which is limited to 10 in a degree 81 atoms. The thinking will use the ideal world which is perpetual.
In each science axioms - the decisive trues accepted on belief are formulated. In cryptography there are some such trues:
1. If the algorithm of encryption always it is possible to decrypt
the message is known. In it the assertion the ideal world mixs up with
the real world. Certainly, theoretically we can create the array of
the strings including 8,5 x 10 in a degree 506 units and to decrypt
the message. Problems arise in case of real incarnation of the speculative conclusion. At first, there is no place to place the array of strings, and second, time of exhaustive search of the array of strings is
monstrously great. The program on encryption of files random bytes is
distributed together with the initial code, therefore the algorithm of
encryption is known for all. However to decrypt the ciphered file will fail.
The ideal world to us while is accessible only through the real
world. For the first time the mankind has collided that, that the ideal
object multiply exceeding on a size all physical world will be used. Thus,
the object objectively not conceivable by virtue of his monstrous value will be used. The ideal object will be used through the limited physical world of the computer.
2. To the assaulting side all data on encryption, except for keys
(passwords) are known. In this assertion the assertion about popularity of all data is erratic. The program on encryption of files random bytes will use a part of strings from all set in 8,5 x 10 in a degree 506. It is
usual from 256 up to 2048 strings. However the program will use which parts of these strings is not known even to the author. The ideal and real world here too mixs up.
3. Randomness cannot be used in practical activities on encryption of files as truly the random number cannot be generated. The ideal and real world here too mixs up. In the ideal perpetual world an amount of links between objects indefinitely and consequently randomness (absence of dependence on remaining objects) is absent. In the real world an amount of objects certainly and, therefore, an amount of links between objects certainly.
From above-stated the following problems subject to solution to
new inquisitive generation of earthmen follow:
A) To find the algorithm (formula), permitting on a line number
to calculate contents of string bytes, used for encryption. Numbers of
strings vary from 1 up to 8,5 x 10 in a degree 506. Solution of this
problem will allow to create algorithm on decryption of files.
B) To find a method of mapping of ideal objects of a huge size on our physical world. Solution of this problem will allow to involve the
perpetual world of ideal objects in economic activities.
C) To find a method of effraction of the ciphered files on a
method of encryption random bytes.
The initial code of the program, the executed code of the program, the description of algorithm, the description of the program free of charge can be loaded from sites:
http://crypto-service.narod.ru, http://crypto-service.boom.ru,
http://www.geocities.com/nik_crypto
Yours faithfully the author - Andrejchikov Nikolay Iosifovich.