Title of Invention

A METHOD FOR TRANSFORMING/DECODING DATA AND DEVICE THEREFOR

Abstract The invention relates to means for protecting information from an unauthorised access by electronic means. In order to transform the initial information the device has the transformation unit (4), the making decision unit (3), the storage of the recovered communication (6), the commutator (8), and for storing the accessory information the device has the storage of the accessory information (7). For encoding and transferring information the addressee is beforehand provided with a key to the received communications with information on regularities corresponding to the values of the communication transmitted to him, with specific values of the initial information for the whole set of symbols of the said kind of an information. In this case the addressee is beforehand provided with a set of transformation functions, Y1, Y2 YN = Yi,(X), where X = {x1, x2, ,xm} is a plurality of specific symbols of the transformed information. In the course of processing the encrypted information the input of the making decision unit (3) enters the information on the number (n) of transformation cycles of the initial communication. Before the beginning of the current transformation cycle, the making decision unit (3) transmits a control signal to the generator of random numbers (5), which generates a random number (Ri), transmits it to the data base (2) and through the latter to the transformation unit.
Full Text A METHOD FOR TRANSFORMING/DECODING DATA
AND DEVICE THEREFOR
The present invention relates to a method for transforming/decoding
data and device therefor, and means for protecting data from an unauthorized
access, and may be used in crypto-systems for encoding, transferring and
decoding communications, and in other systems for protection of data.
The prior art discloses engineering solutions providing protection of
transmitted data by means of a special equipment or encoding software, for
example by using scrambler for protection of telephone conversations [1] pp. 35-
37, Fig. 22. The scrambler operates on the principle on inversion of an audio
signal. As a result of an inversion a usual speech turns to a senseless gang of
sounds, but the initial signal is accepted by the user without any distortion. The
telephone set is equipped with the block for voice modification controlled by the
encoder. The encoder stores 13122 user's codes providing 52488 digital
combinations. The read-only memory of the set stores the resident software, which
codes and decodes the transmitted data in several variants and controls the work
of the whole set.
However this prior art solution has problems in providing a fair degree of
secrecy, since for disclosing the confidential codes it is enough to execute a
limited number of mathematical operations that are fast and effectively executed
by the modern high-speed electronic engineering.
The main characteristic of a crypto-system is the degree of secrecy. The
task of a cryptographer is to provide the utmost secrecy and authenticity of the
transferred data. Alternatively, a crypto-analyst "forces open", or "breaks", the
crypto-system designed by a cryptographer. The crypto-analyst tries to decipher
the set of encoded symbols and to deliver the encrypted communication as it
plaintext.
Prior art discloses technical solutions for protecting the transferred data by
using a specific device and/or encoding software. Known codes are based on two
simple methods: substitution and interchange. Interchange uses simple mixing of
plain-text symbols, the key of an interchange encryptor defines the specific type of
mixing. The frequency distribution of individual symbols in the encoded text is
identical to that of the plaintext. For substitution, each symbol of the plaintext is
replaced by another symbol of the same alphabet, and the specific type of
substitution is determined by the secret key.
For example, the algorithm in the Data Encryption Standard (DE3, [2], p.
33-34 uses the both methods. The algorithm comprises plaintext, unencrypted text
and the key as binary sequences having the length 64, 64 and 56 bits,
respectively. When DES is used in an electronic book or table mode, the 64-bit
blocks of the plaintext are encoded independently by using one key. The algorithm
of DES includes 16 rounds or cycles, each of which has simple interchanges
combined with substitution in four-bit groups. In each pass, 48 key bits are
selected in a pseudo-random manner from the full 56-bit key.
The problem of DES is that this prior art solution does not provide a fair
degree of secrecy, since for disclosure of such secret codes with possible number
of 264 keys combinations, substituting of all keys during a brute-force attack using
modern computer techniques is performed in an acceptable time. Also, using the
same plaintext and not varying the keys, produces the same encoded text.
Analysis reveals the statistical regularity of the correlation between the plaintext
and the encoded text, and may allow decoding the encoded text without using
direct substitution of all the keys.
A crypto-system using public keys RSA is described in [2] p. 37-39. This
system uses a one-way function - discrete logarithms raising to a power.
GOST P. 34.11 - 94 [3], p. 3-8 discloses hatching consisting in
comparing an optional set of data as a sequence of binary symbols, with a short,
fixed length image thereof. In this system 64-bit subwords are encoded using
keys of 256 bit length.
The drawbacks of these systems are small the key length, which may
permit decoding during acceptable time, and a slow decoding speed. These
systems are practically stable systems.
Theoretically stable systems have perfect secrecy. According to Shannon
[4] p. 333-402, that means that the plaintext, and the encoded text or cryptogram
are statistically independent for all plaintext and cryptograms.
A prior art Vernan crypto-system is a theoretically stable crypto-system.
Theoretically stable systems make certain demands on a key. For a system with
closed keys the indeterminacy of the key should not be less than the
indeterminacy of the plaintext. In theoretically stable systems the length of a key-
should be not less than the length of the plaintext. In the Vernan system the key
length is equal to the length of the plaintext. This system was used in a code-
notebook [5] for transfer of one encoded text. This is the main drawback of a
codebook because the key should be changed and delivered with every transfer.
There are known crypto-systems using the so-called randomisers [2] p. 26
- 27. A randomiser is a software or a hardware device that encodes some
symbols of plaintext with some random plurality of codes.
Typically, this is done for providing equal frequency of the plaintext
alphabet. Symbol frequency equalisation is required so that a crypto-analyst
cannot organise decoding of a plaintext based on analysis of frequency
characteristics of a cryptogram. For a random plaintext and a random selection of
a code, a derandomiser should correctly determine the initial symbol without
transfer of data from the randomiser location. In classical systems with a small
randomising field, this task is solved by substituting codes belonging to the
randomised symbol. Randomisers, however, do not play a substantial role in
crypto-protectability of an encoding system, as secret keys are the main means of
protection.
Under the combination of the essential features the most close prior art
object to the claimed method and device is the disclosed in [6] the device and
method of encoding that use a principle of full randomizing symbols of the initial
alphabet on a plurality of codes with potencies of large dimensionality, The said
prior art invention was selected by the inventors for the prototype of the ciaimed
invention.
In respect of a method the selected for the prototype object is a method of
encoding and transferring data, wherein the addressee is beforehand provided for
a key to the received communications with data on regularities corresponding to
the values of the communication transmitted to him, with specific values of the
initial data for the whole set of symbols of the said kind of an data, processing an
data using the said regularities and transferring to the addressee the
communication containing data, obtained during processings data, the values of
transmitted data, which depend on random generated numbers being calculate
during processing data, characterized in that the addressee is beforehand
provided with a set of functions Y1...Y0 =Yi(X), where X is a variable, and each Yi
corresponds to a specific symbol of data, and also with the support function U = U
Accordingly, the present invention provides a method for transforming
data, comprising encoding the data prior to transfer via communication system or
storage in the memory, the encoding comprising the steps of:
preliminary generating data on plurality of characteristic functions
that transform values of an initial information of a full set of symbols into
encoded data;
- determining the number (n) of cycles of transforming the initial data;
- realizing the cycle (i) of transforming which comprises :
- generating the feature (R,) that determines the regularity used for
transforming the data in the current transformation cycle (i);
- transforming the data using the selected characteristic functions ;
- repeating cycles of transformation a certain number (n) of times ;
characterized in that,
• transforming of the data in each cycle is performed in such a way
that results in forming a transformed in the said cycle data (Ci) and the accessory
data (Fi) for the said cycle (i);
• the number (n) of cycles of the transformation of the initial data is
selected from the preassigned criterion,
• forming an encoded data consisting of two parts, one of the said
parts comprises the finally transformed data (Cn), and the second one comprises
the accessory data array (F = {F1, F2....,Fn}).
The present invention also provides a device for realizing the method for
encoding of data, comprises :
• an input unit,
• an output unit, the first input of which is connected with the second
output of the commutator, and the second - with the output of the accessory data
storage ;
• data base on the plurality of characteristic functions that transform
the initial data with the encoded data, the first input of the said data base being
connected with the first output of the input unit and the second input - with the
output of the random numbers generator;
characterized in that, the device comprises
• a random number generator, the input of which is connected with
the first output of the making decision unit;
• the transformation unit, the first input of which is connected with the
second output of the output unit, the second input -with the output of the data
base, and the third input -with the first output of the commutator;
• the storage for the transformed data, the input of which is
connected with the first output of the transformation unit;
• a storage for the accessory data, the first input of which is
connected with the second output of the transformation unit, and the second
input - with the second output of the making decision unit;
• the making decision unit, the first input of which is connected with
the third output of the input unit, the second input - with the first output of the
storage for the transformed communication ;
• the commutator, the first input of which is connected with the
second output of the storage for the transformed communication, and the
second input - with the second output of the making decision unit.
The present invention further provides a method for decoding of the
encoded data comprising the steps of:
• preliminary generating data on plurality of characteristic functions
that transform values of all encoded symbols that may be used in the said kind of
data with initial symbols, which are identical to the characteristic functions used
at encoding ;
• extracting, from the encoded data, of the data (Ri), defining the
characteristic functions which are used in the current transformation cycles and
connects the values of the encoded data with the concrete symbols of the
transformed data of the current transformation cycle ;
• selecting the regularity connecting the values of the encoded data
with the concrete symbols of the transformed data of the current transformation
cycle ;
• extracting from the accessory data (F) the accessory data (Fi) for
the said transformation cycle (i) ;
• transforming the transformed data (Ci) using the selected regularity
and the accessory data (Fi) for the said transformation cycle (i);
• making decision on switching to the next cycle or termination of the
transformation ;
characterized in that, the accessory data (Fi) for the said transformation
cycle (i); is isolated from the array of the accessory data (F);
• recovering the data (Ci), which is transformed in the respective
cycle, by using the selected regularity and the accessory data (Fi) for the said
transformation cycle (i) ;
• making decision on switching to the next cycle or termination of the
transformation ;
• using additionally in each transformation cycle(i) a respective part
of the accessory data (Fi), as a result of transforming with the use of the selected
characteristic functions there is formed the data recovered in the respective
cycle.
The present invention still further provides a device for realizing the
method for decoding data, comprises :
• an input unit,
• an output unit,
• data base on the plurality of characteristic functions that transform
the encoded data with the initial data,
characterized in that, the device comprises
• a transformation unit;
• a storage of the recovered communication ;
• a storage of the accessory data ;
• a making decision unit;
• a commutator,
the first input of the accessory data storage connected with first output of the
input unit and the second input of the accessory data storage connected with
first output a making decision unit; the first input of data base is connected to the
second output of the of the input unit, and the second input - to the first output of
the storage for accessory data; the first input of the storage of the recovered
data is connected to the third output of the input unit, the second - to the output
of the transformation unit, and the third - to the first output of the making decision
unit, the first input of the transformation unit is connected to the second output of
the storage of accessory data, and the second - to the output of database, the
third to the first output of the storage of recovered data ; the second - to the
fourth output of the input unit, the first input of the commutator is connected to
the second output of the making decision unit, and the second - to the second
output of the making decision unit, the output unit is connected to the second
commutator output.
(Z), where Z is a variable, and with the key function W = W (Y, U), where Y and U
are variables accepting values of any of the values from the values of the said
functions Yi and U, in the course of processing of a transmitted data for each
symbol there are generated two random numbers X and Z, the respective value of
Y is calculated on basis of the respective function Yi (X) for a specific symbol, the
value of U is further calculated on basis of the support function U (Z), the value of
W for this symbol is calculated on basis of the key function W (Y, U) and obtained
for the symbol value of Y and the value of U from the support function, and the
addressee is transmitted the communication containing data on the thus obtained
values of W, X and Z for each symbol of the initial data.
In respect of a device, the object selected for the prototype is a device for
realizing a method of encoding and transferring data, which comprises a unit for
data input, a set of symbols, a data base on plurality of characteristic functions that
transform the specific symbols with the communication, which data base is
supplied with a calculator connected to the generator of random numbers, the
device further comprising the encoder and the unit for recording and transmitting
communications, and the encoder being connected to the set of symbols and
calculator output, the device further comprising a unit for calculating the values of
the support function and a unit for calculating the values of the key function, the
generator of random numbers is supplied with two outputs joint with the encoder,
the first output of the generator of random numbers is connected also to the input
of the unit for calculating values of the support function, and second - to the input
of the calculator of the data base on regularities, the output of this calculator is
connected to the encoder through the unit for calculating values of the key
function, and the second input of the latter is connected to the output of the unit for
calculating values of the support function.
However the problem of object selected for the prototype is that in the
course of the encryption the length of the encrypted communication exceeds the
length of the initial communication by several times.
The aim of the claimed invention is providing an improved method of
encrypting by means of obtaining several communications from one initial, at least
one of the obtained communications may be compressed up to preset sizes so
that any connection between the initial text and the cryptogram is completely is
lost for a cryptoanalyst.
As a result of the solution of the problem there is achieved a new technical
effect consisting in creating a new system of encrypting that ensures a high crypto-
stability of a system without any increase of the length of the communication.
The said technical effect is achieved as follows.
The method of encrypting of an data comprises the following steps:
• Preliminary generation of data on plurality of characteristic functions that
transform the values of symbols of the initial communication with the specific
values of the encrypted communication for the total set of values of the said
kind of communications;
• determination the number (n) of transformation cycles of the initial
communication;
• realization of the transformation cycle comprising:
• generation of the feature (Ri), defining regularity used for transformation of the
communication in the current transformation cycle;
• transformation of the communication with use of the selected regularity;
• repetition of transformation cycles the certain number of times;
• transformation of the communication in each cycle being realized in a way
resulting in forming a communication (Ci), transformed in the said cycle and the
accessory data for the said cycle (Fi);
• the number (n) of transformation cycles of the initial communication is selected
from the preset criterion,
• forming the encrypted communication consisting of two parts, one of which
contains the finally transformed communication (Cn), and second one contains
a set of the accessory data (F = {F1, F2, ..., Fn}).
The further improvement of the method is characterized by that:
• transformation of the communication in each cycle is realized in a way resulting
in forming a communication (Ci) transformed in the said cycle, being of the
shorter or equal length with the initial communication, and resulting in forming
an accessory data for the said cycle (Fi);
• the number (n) of transformation cycles of the initial communication is selected
from the preset criterion (for example, the size of the finally transformed
communication),
• forming the encrypted communication consisting of two parts, one of which
contains the finally transformed communication (Cn) being of the shorter length
with the initial communication, and second one contains a set of the accessory
data(F = {F1. F2, ..., Fn}).
Still further improvement of the method is characterized by that:
• transformation of the communication in each cycle realizes in a way resulting in
forming a communication (Ci) transformed in the said cycle, being of the
shorter, equal or longer length with the initial communication, and resulting in
forming an accessory data for the said cycle (Fi);
• the number (n) of transformation cycles of the initial communication is selected
from the preset criterion (for example, the size of the finally transformed
communication),
• forming the encrypted communication consisting of two parts, one of which
contains the finally transformed communication (Cn) being of the shorter, equal
or longer length with the initial communication, and second one contains a set
of the accessory data (F
The further improvement of a method is characterized by that in each or
some cycles the communication (Ci) transformed in the said cycle and (or) an
accessory data for the said cycle (Fi) are intermixed.
The following improvement of the method is characterized by that in each or
some cycles of transformation the certain part of an accessory data for the said
cycle (Fi) is added into the transformed in the said cycle communication (Ci).
The structural interpretation of stated ideas could be considered on an example of
the claimed device.
The device for a realizing the method of encrypting data comprises:
• an input unit,
• an output unit, the first input of which is connected to the second output of the
commutator, and the second — to the output of the accessory data storage ;
• data base on the plurality of characteristic functions that transform the initial
data with the encoded data, the first input of the said data base being
connected to the first output of the input unit and the second input - to the
output of the random numbers generator;
• a random number generator, the input of which is connected to the first output
of the making decision unit;
• the transformation unit, the first input of which is connected to the second output
of the output unit, the second input - to the output of the data base, and the
third input -to the first output of the commutator;
• the storage for the transformed data, the input of which is connected to the first
output of the transformation unit;
• a storage for the accessory data, the first input of which is connected to the
second output of the transformation unit, and the second input - to the second
output of the making decision unit;
• the making decision unit, the first input of which is connected to the third output
of the input unit, the second input - to the first output of the storage for the
transformed communication;
• the commutator, the first input of which is connected to the second output of the
storage for the transformed communication, and the second input - to the
second output of the making decision unit.
Another method of decoding encrypted data comprises the following steps:
• preliminary generating data on plurality of characteristic functions that transform
values of all encoded symbols that may be used in the said kind of data with
initial symbols, which are identical to the regularities used at encoding;
• extracting, from the encoded communication, of the data (Rj), defining the
regularity which is used in the current transformation cycles and connects the
values of the encoded communications with the concrete symbols of the
transformed data of the current transformation cycle;
• selecting the regularity connecting the values of the encoded communications
with the concrete symbols of the transformed data of the current transformation
cycle;
• extracting from the accessory data (F) the accessory data for the said
transformation cycle (Fj);
• transforming the transformed data (C,) using the selected regularity and the
accessory data for the said transformation cycle (Fj);
• making decision on switching to the next cycle or termination of the
transformation;
• the accessory data for the said transformation cycle (F,); being isolated from
the array of the accessory data (F);
• recovering the data (Ci), which is transformed in the respective cycle, by using
the selected regularity and the accessory data for the said transformation cycle
(Fi);
• making decision on switching to the next cycle or termination of the
transformation;
• using additionally in each transformation cycle a respective part of the
accessory data, as a result of transforming with the use of the selected
regularity there is formed the data recovered in the respective cycle.
The further improvement of a method is characterized by that:
• in each transformation cycle there is additionally used a respective part of the
accessory data and as a result of the transformation with use of the selected
regularity there is formed a recovered in the corresponding cycle
communication, the length of which is larger or equal to the length of the
communication, resulting from transforming in the previous cycle.
The following improvement of a method is characterized by in each
transformation cycle there is additionally used a respective part of the accessory
data, and as a result of transformation with use of the selected regularity there is
formed a recovered in the respective cycle communication, the length of which is
larger, equal or smaller than the length of the communication, resulting from
transforming in the previous cycle.
One more improvement of the method is characterized by that the
transformed in the respective cycle data (Ci) and/or the accessory data for the
respective cycle (F1) is preliminary unmixed in each cycle or in some cycles;
The device for realizing the method of decoding of the communication,
comprises:
• an input unit (10),
• an output unit (15),
• data base on the plurality of characteristic functions that transform the encoded
data with the initial data (2),
• a transformation unit (12);
• a storage of the transformed data (14) ;
• a storage of the accessory data (13);
• a making decision unit (11);
• a commutator (8),
the first input of the accessory data storage (13) being connected with first output
of the input unit (10) and the second input of the accessory data storage (13)
being connected with first output a making decision unit (11); the first input of data
base (2) is connected to the second output of the of the input unit (10), and the
second input - to the first output of the storage for accessory data(13); the first
input of the storage of the recovered data is connected to the third output of the
input unit, the second - to the output of the transformation unit, and the third - to
the first output of the making decision unit, the first input of the transformation unit
is connected to the second output of the storage of accessory data, and the
second - to the output of database, the third to the first output of the storage of
recovered data; the second - to the fourth output of the input unit, the first input of
the commutator is connected to the second output of the making decision unit, and
the second - to the second output of the making decision unit, the output unit is
connected to the second commutator output.
With the first output (exit) of the switchboard: the first input (entrance) of the block
of a decision making is connected to the first output (exit) of an accumulator of the
restored communication, and second — With the fourth output (exit) of the block of
input; the first input (entrance) of the switchboard is connected to the second
output (exit) of the block of a decision making, and second — With the second
output (exit) of an accumulator of the restored communication; the block of a
conclusion is connected to the second output(exit) of the switchboard.
The distinctive feature of the new method can be illustrated by the following
example. Symbols of the initial alphabet A {a1, a2, ..., an} being such, that the
binary representation of each symbol has the identical length for the whole
alphabet A, are substituted with symbols of the alphabet Bi {b1i, b2i, ..., bni} being
such, that the binary representation of each symbol may have a various length, the
process of such replacement is iterative, i. e. at each i-step for the initial
communication there is used a result of the substitution obtained at the i-1step, at
each i-step there is used its own substitution alphabet Bi, produced with the help
of the function Yi, selected by a casual mode from a plurality of functions
transferred to the addressee beforehand, and at each i-step there is produced the
accessory data Fi used for restoring the initial communication is produced. As an
additional measure of protecting from cryptanalysis, on each step or on some
steps there may be performed intermixing of the communication resulting from the
transformation. In an outcome of such transformation there is produced a
transformed text (Cn), length of which may be not than the less length of one
symbol of the alphabet Bn, used at the last step of transformation.
Such systems have uncommon properties:
• as a result of transformation of the initial communication there are produced at
least two output communications (the transformed communication (Cn) and the
accessory data (F), each of which separately has not any sense from the point
of view of restoring the initial communication and may be transmitted through a
separate data link;
• generally, the length of the transformed communication may have the length of
one symbol of the substitution alphabet, for example if the initial communication
has the byte representation, the transformed communication may have the one
byte length, regardless of the length and kind of the initial communication;
• at multiple encoding one and the same initial communication the transformed
communication will be various, eliminating thereby a problem of the closed
channel for the key data transfer;
• The modification of ay symbol in the transformed communication or accessory
data brings about the impossibility of restoring the initial communication.
The transformation functions (Yi) may be preset in the form of a table. For
example, in case of representing the initial communication as N-bit binary
sequences and transformation of compression of the function Yi, can be preset as
a set of 2N triples — {(ak, bik, fik)}, where ak is an N-bit initial code, bik is a
transformed bit code of a variable length not greater N, and only two values of
{bik} have the length of N bit, fik is the data on the length of the respective bik in
bits. At such representation there exist such submission exist
of various possible functions of transformation such,
is length of bik in bits. At N = 8 there is present
of various transformation functions (Yi). In this case two
values of bik have the one bit length, four values of bik have the two bit lenght,
eight values of bik have the three bit length, sixteen values of bik have the four bit
length, a thirty two values of bik have the five bit length, sixty four values of bik
have the six bit length, one hundred twenty eight values of bik have the seven bit
length and two values of bik have the eight bit length.
Then for an arbitrary function Yi the average length of the transformed
communication X will be equal:

and the average length of an accessory data:

thus the average compression ratio at one step of transformation will have the
values:

In particular, for N = 8 we have: Kcore = 777/1024 0.758 Kflags = 255/1024
At performing transformation M cycles the anticipated average length of the
transformed communication will be:

Accordingly at performing 10 transformation cycles the average length of
the transformed communication at of N = 8 will make approximately 0,067 of the
length of the initial communication, and length of the accessory data — 0.97 of the
length of the initial communication. The general length will make approximately
1.037 of the initial length, and for 100 transformation cycles — 10-12 and 1.04
accordingly.
If at each transformation cycle a S byte of the accessory data is added to
the transformed communication, then average length of the transformed
communication will be:

And length of an accessory data will make:

The construction of the claimed device may be realized in various variants
realizing the claimed method of encoding data by using the known hardware. Ail
these variants expand technological possibilities of using of the invention.
The main problem of the prototype method is eliminated thereby, i.e. essential
increase of the sizes of the encrypted communication in a comparison with the
initial one. The disclosed distinctive features of the claimed invention, in a
comparison with known engineering solutions allow designing a device of
encoding data providing statistical independence of the encrypted text and the
open text, i.e. having properties of the theoretically stable of proof system of
cryptography, and not by recurrence of the encrypted communication at repeated
encoding of one and the same communication at constant keys.
Fig.1 shows a diagram of the device illustrating realization of a claimed
method of encoding data is represented. Through the input unit the data base
enters the pre- generated data on plurality of characteristic functions that
transform values of symbols of the initial communication with specific symbols of
the encrypted communication for the whole set of symbols of the said kind of the
communications. In the course of processing the encrypted data the input of the
making decision unit (3) enters the data on the number (n) of transformation cycles
of the initial communication. Before the beginning of the current transformation
cycle, the making decision unit (3) transmits a control signal to the generator of
random numbers (5), which generates a random number (Ri), transmits it to the
data base (2) and through the latter- to the transformation unit In accordance with
the value of Ri from the database (2) there is selected the transformation function
of YRi which enters the transformation unit (4). The transformation unit (4)
calculates s the values of (Ci, Fi) = YRi (Xi, Ri). The value of Ci enters the input of
the storage of the transformed communication (6) from outputs of the
transformation unit (4) and the value of Fi enters the input of the storage of the
accessory data (7). The storage of the transformed communication (6) transmits a
signal on termination of the current cycle of transformation to the making decision
unit (3). The making decision unit (3) makes a decision on fulfillment of the next
transformation cycle or on terminating the process of transformation. In case of
decisionmaking on the terminating the process of transformation the transformed
data (Cn) through the switchboard (8) and the accessory data F = {F1, F2, ..., Fn}
from the storage of an accessory data (7) enters the output unit (9). Otherwise the
transformed communication (Ci) through the switchboard (8) enters in the
transformation unit (4) for fulfillment the next cycle of transformation.
Fig. 2 shows the diagram of the device illustrating realization of the claimed
method of decoding data. Through the input unit (10) into the data base (2) come
the previously generated data on plurality of characteristic functions that transform
values of symbols of the initial communication with special symbols of the
encrypted communication for the whole set of symbols of the said kind of the
communications, which are identical to the regularities used at encoding. In the
course of restoring the transformed communication through the input unit (10)
enter the following data: at the input of the decision making unit (11) - data on the
number (n) of transformation cycles of the deencrypted communication; at the
storage of the accessory data (14) - the accessory data; at the storage of the
restored communication (13) - the transformed communication. Before the
beginning of the current cycle of restoring at the signal of the decision making unit
(11) the storage of the accessory data (14) yields the accessory data (Fi) into the
transformation unit (12) and the value of Ri - into the data base (2), in accordance
with which is selected the function of transformation of Yri that arrives at the
transformation unit (12), and the storage of the restored communication (13) yields
through the switchboard (8) the transformed communication (Ci) into the
transformation unit (12). The transformation unit (12) calculates the values of (Xi))
YRi (Ci, Fi). From the output of the transformation unit (12) the restored
communication (Xi)) arrives into the storage of the restored communication (13).
At completion of accumulation of the restored communication (Xi)) the storage of
the restored communication (13) sends a signal on termination of the current cycle
of restoring into the decision making unit (11). In case of decision-making on ,:ie
termination of process of transformation the restored communication (Xi)) through
the switchboard (8) arrives to the output unit (15). Otherwise from the output of the
decision-making unit (11) at the input of the storage of the accessory data (14)
arrives the signal on yielding of the next portion of the accessory data (Fi, Ri) a J
the restored communication arrives through the switchboard (8) at the
transformation unit (12) for fulfillment of the next cycle of restoring.
Bibliographic data of sources of data
1. Victor Gavrish "Practical Guide on Protecting Commercial Secrets". Simferopol,
TAVRIDA, 1994, p.35-37.
2. . Schmidt M. E., Bransted D.K. "Standard of Data Encoding: Past and Future"
Journal of Works of Electronic and Radio Engineers (TIIER), 1988, v.76, no. 5.
p. 33-34.
3. GOST 34.11-94 Data Technology, Crypto Graphical Protection of Data, Cash
function. M.: Gosstandart of Russia, 1994, 34.11 - 94, p. 3-8.
4. Shannon C. E.. "Communication Theory in Secret Systems". Shannon C. E.
"Works on Data and Cybernetics Theory". M.: IL, 1963, p. 333-402,
"Theoretically Stable system,", as cited in "An Introduction to Contemporary
Cryptology", Proceedings of the IEEE, v. 76. No. 5, May 1998.
5. Vernan. Copher printing telegraph systems for secret wire and radio telegraphic
communications. //J Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926.
6. Mischenko V.A, Zakharov V.V. A method of encoding and transfer data and
the device for a realization the method // Official Gazette of the Belarusian
Patent Office. No.4, part I, 1997
7. Golubev V.V. Computer crimes and protection of data in computing systems //
News in life, science and engineering. Part. Computer engineering and use
thereof. Protection of data.- M.: Znanie, 1990.
WE CLAIM :
1. A method for transforming data, comprising encoding the data prior to
transfer via communication system or storage in the memory, the encoding
comprising the steps of:
- preliminary generating data on plurality of characteristic functions
that transform values of an initial information of a full set of symbols into
encoded data ;
- determining the number (n) of cycles of transforming the initial data;
- realizing the cycle (i) of transforming which comprises :
- generating the feature (R,) that determines the regularity used for
transforming the data in the current transformation cycle (i) ;
- transforming the data using the selected characteristic functions ;
- repeating cycles of transformation a certain number (n) of times ;
characterized in that,
• transforming of the data in each cycle is performed in such a way
that results in forming a transformed in the said cycle data (G) and the accessory
data (Fi) for the said cycle (i);
• the number (n) of cycles of the transformation of the initial data is
selected from the preassigned criterion,
• forming an encoded data consisting of two parts, one of the said
parts comprises the finally transformed data (Cn), and the second one comprises
the accessory data array (F = {F1, F2,...,Fn}).
2. The method for encoding data as claimed in claim 1, wherein
• the said cycle data (G), that is shorter or equal to the length of the
initial data ;
• the number (n) of cycles of the transformation of the initial data is
selected from the predetermined criterion determining the size of the finally
transformed data,
• the finally transformed data (Cn) that is shorter than the length of
the initial data.
3. The method for encoding data as claimed in claim 1, wherein
• the cycle data (Ci) is shorter, equal or longer than the length of the
initial data ;
• the number (n) of cycles of the transformation of the initial data is
selected from the predetermined criterion, determining the size of the finally
transformed data and/or the degree of protectability of encoded data ;
• the finally transformed data (Cn) that is shorter, equal or longer than
the length of the initial data.
4. The method as claimed in claims 1, 2 or 3, wherein the transformed in the
said cycle data (G) and/or the accessory data (Fi) for the said cycle (i) are mixed
in each cycle or in some cycles.
5. The method as claimed in claims 1, 2, or 3, or 4, wherein the certain part
of the accessory data (Fi) for the said cycle (i) is added to the transformed in the
said cycle data (Ci) in each or some transformation cycles.
6. A device for realizing the method for encoding of data, comprises :
• an input unit,
• an output unit, the first input of which is connected with the second
output of the commutator, and the second - with the output of the accessory data
storage ;
• data base on the plurality of characteristic functions that transform
the initial data with the encoded data, the first input of the said data base being
connected with the first output of the input unit and the second input - with the
output of the random numbers generator;
characterized in that, the device comprises
• a random number generator, the input of which is connected with
the first output of the making decision unit;
• the transformation unit, the first input of which is connected with the
second output of the output unit, the second input -with the output of the data
base, and the third input -with the first output of the commutator;
• the storage for the transformed data, the input of which is
connected with the first output of the transformation unit;
• a storage for the accessory data, the first input of which is
connected with the second output of the transformation unit, and the second
input - with the second output of the making decision unit;
• the making decision unit, the first input of which is connected with
the third output of the input unit, the second input - with the first output of the
storage for the transformed communication ;
• the commutator, the first input of which is connected with the
second output of the storage for the transformed communication, and the
second input - with the second output of the making decision unit.
7. A method for decoding of the encoded data comprising the steps of:
• preliminary generating data on plurality of characteristic functions
that transform values of all encoded symbols that may be used in the said kind of
data with initial symbols, which are identical to the characteristic functions used
at encoding ;
• extracting, from the encoded data, of the data (Ri), defining the
characteristic functions which are used in the current transformation cycles and
connects the values of the encoded data with the concrete symbols of the
transformed data of the current transformation cycle ;
• selecting the regularity connecting the values of the encoded data
with the concrete symbols of the transformed data of the current transformation
cycle ;
• extracting from the accessory data (F) the accessory data (Fi) for
the said transformation cycle (i);
• transforming the transformed data (Ci) using the selected regularity
and the accessory data (Fi) for the said transformation cycle (i) ;
• making decision on switching to the next cycle or termination of the
transformation ;
characterized in that, the accessory data (Fi) for the said transformation
cycle (i); is isolated from the array of the accessory data (F);
• recovering the data (Ci), which is transformed in the respective
cycle, by using the selected regularity and the accessory data (Fi) for the said
transformation cycle (i);
• making decision on switching to the next cycle or termination of the
transformation ;
• using additionally in each transformation cycle(i) a respective part
of the accessory data (Fi), as a result of transforming with the use of the selected
characteristic functions there is formed the data recovered in the respective
cycle.
8. The method of decoding the encoded data as claimed in claims 7,
wherein
• in each transformation cycle there is additionally used a respective
part of the accessory data and as a result of transformation with use of the
selected characteristic functions there is formed a recovered in the
corresponding cycle communication, the length of which is larger or equal to the
length of the communication, resulting from transforming in the previous cycle.
9. The method of decoding the encoded data as claimed in claims 7,
wherein
• in each transformation cycle there is additionally used a respective
part of the accessory data, and as a result of transformation with use of the
selected regularity there is formed a recovered in the respective cycle
communication, the length of which is larger, equal or smaller than the length of
the communication, resulting from transforming in the previous cycle.
10. The method as claimed in claims 7, 8 or 9, wherein the transformed in the
respective cycle data (Ci) and/or the accessory data (Fi) for the respective cycle
(i) is preliminary unmixed in each cycle or in some cycles.
11. A device for realizing the method for decoding data, comprises :
• an input unit,
• an output unit,
• data base on the plurality of characteristic functions that transform
the encoded data with the initial data,
characterized in that, the device comprises
• a transformation unit;
• a storage of the recovered communication ;
• a storage of the accessory data ;
• a making decision unit;
• a commutator,
the first input of the accessory data storage connected with first output of the
input unit and the second input of the accessory data storage connected with
first output a making decision unit; the first input of data base is connected to the
second output of the of the input unit, and the second input - to the first output of
the storage for accessory data; the first input of the storage of the recovered
data is connected to the third output of the input unit, the second - to the output
of the transformation unit, and the third - to the first output of the making decision
unit, the first input of the transformation unit is connected to the second output of
the storage of accessory data, and the second - to the output of database, the
third to the first output of the storage of recovered data ; the second - to the
fourth output of the input unit, the first input of the commutator is connected to
the second output of the making decision unit, and the second - to the second
output of the making decision unit, the output unit is connected to the second
commutator output.
The invention relates to means for protecting information from an unauthorised access by electronic means. In order to transform the
initial information the device has the transformation unit (4), the making decision unit (3), the storage of the recovered communication (6),
the commutator (8), and for storing the accessory information the device has the storage of the accessory information (7). For encoding and
transferring information the addressee is beforehand provided with a key to the received communications with information on regularities
corresponding to the values of the communication transmitted to him, with specific values of the initial information for the whole set of
symbols of the said kind of an information. In this case the addressee is beforehand provided with a set of transformation functions, Y1,
Y2 YN = Yi,(X), where X = {x1, x2, ,xm} is a plurality of specific symbols of the transformed information. In the course of processing
the encrypted information the input of the making decision unit (3) enters the information on the number (n) of transformation cycles of the
initial communication. Before the beginning of the current transformation cycle, the making decision unit (3) transmits a control signal to
the generator of random numbers (5), which generates a random number (Ri), transmits it to the data base (2) and through the latter to the
transformation unit.

Documents:

in-pct-2001-1230-kol-abstract.pdf

in-pct-2001-1230-kol-claims.pdf

IN-PCT-2001-1230-KOL-CORRESPONDENCE 1.1.pdf

in-pct-2001-1230-kol-correspondence.pdf

in-pct-2001-1230-kol-description (complete).pdf

in-pct-2001-1230-kol-drawings.pdf

in-pct-2001-1230-kol-examination report.pdf

in-pct-2001-1230-kol-form 1.pdf

in-pct-2001-1230-kol-form 13.pdf

in-pct-2001-1230-kol-form 18.pdf

IN-PCT-2001-1230-KOL-FORM 27.pdf

in-pct-2001-1230-kol-form 3.pdf

in-pct-2001-1230-kol-form 5.pdf

in-pct-2001-1230-kol-gpa.pdf

in-pct-2001-1230-kol-reply to examination report.pdf

in-pct-2001-1230-kol-specification.pdf


Patent Number 238272
Indian Patent Application Number IN/PCT/2001/1230/KOL
PG Journal Number 05/2010
Publication Date 29-Jan-2010
Grant Date 28-Jan-2010
Date of Filing 23-Nov-2001
Name of Patentee MICHTCHENKO VALENTIN ALEXANDROVICH
Applicant Address CHEHOVA STR. 3/34, 220035 MINSK
Inventors:
# Inventor's Name Inventor's Address
1 ZAKHARAU ULADZIMIR ULADZIMIROVICH 1-2-22, 50 LET POBEDY STR., MINSK, 220056
2 VERZHBALOVICH DZMITRY I MVIZRU PVO, MINSK 220057
3 VILANSKI YURI V 10-44, KULESHOVA STR., MINSK 220026
PCT International Classification Number H04L 9/06
PCT International Application Number PCT/BY1999/00005
PCT International Filing date 1999-04-27
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 NA