New cryptosystem

From: Yuriy Nedosekin (physicis@mtu-net.ru)
Date: 02/22/02 

From: "Yuriy Nedosekin" <physicis@mtu-net.ru>
Date: Fri, 22 Feb 2002 07:46:23 +0300

    NEW METHOD of CONVERSION of the INFORMATION
    The information processing which may be used in cryptography, computer facilities, cybernetics, coding and communication systems is developed. The plain text may be transformed into the enciphered text in an arbitrary number system. The system allows to construct a great many of various systems of encryption with the necessary properties and with any, practically necessary, decipherability. One of applications of the given method is the one-key continuous cryptosystem. Properties of a cryptosystem and modes of its operation are determined by structure of a key.
    Cryptosystems with the following properties may exist:
    1. The amount of keys may be arbitrary large.
    2. M-bit characters of a text in code which length is equal to those of a plain text act on an input of algorithm. In a binary number system m-bit characters are m-bit (m=1,2,4,8) characters.
    3. Decoding is carried out in the opposite direction from the extremity of a ciphertext.
    4. The system has an initial state; the status of the system is the function of the previous status and the current entry character of a plain text.
    5. The output character of a ciphertext is a composite function of the current entry character and all previous entry characters of a plain text, all units of a key and an initial state of the system.
    6. Velocities of encryption and decoding do not depend on a key length.
    7. Multiple encryption with usage of different keys is non-commutative.
    8. Outcomes of multiple encryption by different keys or one key may not be obtained by single encryption.
    9. Identical sequences of a plain text are mapped at encryption in different sequences of the same length of a text in code.
    10. Cryptanalysis: an exhaustive enumeration of keys.
    11. The authentication of the enciphered datas after storage and transmissions on communication circuits may be fulfilled at deciphering with as much as small probability of undetectable modifications. The scheme of authentication is included in encrypting system; the authentication token is not confidential.
    12. At encryption it is possible to use the hidden randomization: at introduction to a plain text of an arbitrary sequence the length of a ciphertext does not vary.
    The method contains description of six different algorithms of encryption and decoding with a great many of the examples illustrating their operation.
    The programs of encryption/decoding and the programs of construction of keys on algorithm of single encryption in C for DOS language are written:
    a) on algorithm; b) with authentication of data; c) with the hidden randomization.
    On the basis of these programs three more programs that take into accont a feedback on a ciphertext are written (modification of characters of a plain text by characters of a ciphertext).
    In the program with the hidden randomization the randomizer fulfils a role of the second private key strengthening decipherability of algorithm.
    There is an algorithm of generation of a sequence of pseudorandom numbers of arbitrary great period. Generating pseudorandom numbers have a uniform distribution. The method allows to create by programming various generators of pseudorandom numbers with the given properties.
    The given method may be effectively used for developments of error-correction coding systems.
  Further development of this method of conversion of the information is possible, submitting to mathematicians and programmers a wide field of action.
    The inventor will sell the given development under the contract.
    
    Please direct your offers to E-Mail: physicis@mtu-net.ru

Relevant Pages
Loading