Data processing apparatus

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a data processing apparatus for compressing/encrypting message data by use of a plurality of function algorithms. The present invention also relates to a modularization technique for the data processing apparatus.
2. Description of the Related Art
In recent years, a data compression type encryption processing function (a hash function), which is applicable to the compression/encryption processing of message data, has attracted the attention of those skilled in the art. To put this function into practice, a method that utilizes, for example, the CBC (cipher block chaining) mode of the DES (data encryption standard) has been proposed.
According to this method, message data subjected to data hashing is divided into data blocks of appropriate size (e.g., L bits) as follows:
{B.sub.i } (i=1 to m)
The encryption processing for the (k+1)th data block (k=0 to m-1) is defined as follows:
C.sub.k+1 =FK(C.sub.k +B.sub.k+1)
It is assumed that FK represents a block encryption processing function using an encryption key K (fixed). It is also assumed that where k=0, an initial vector I.sub.0 is given to C.sub.O. In this case, the hash value is defined by the processing result C.sub.m obtained in the final stage of the processing.
However, the data compression/encryption processing system utilizing the CBC mode has problems in that once the encryption key K is decoded, two different message data items having the same hash value may be easily produced.
Let it be assumed that the data blocks of the two different message data items M and M' are expressed by:
M={B.sub.i }
M'={B.sub.i '}
where i=1 to m. If, in this case, the condition expressed by
C.sub.m-1 +B.sub.m =C.sub.m-1 '+B.sub.m '
is satisfied, the hash values of M and M' become equal to each other though the message data items have been processed in different ways.
In other words, "C.sub.m-1 +B.sub.m " can be presumed based on hash value C.sub.m if the encryption key K is decoded. Hence, M', which has the same hash value as M, can be obtained by performing calculation, with a block group {B.sub.i '} (i=1 to m-1) appropriately determined, and by determining the final block B.sub.m ' to satisfy the condition formula. This means that data collision may easily occur in the encryption processing method which is based on the hash function utilizing the CBC mode.
An encryption LSI (large scale integration circuit) is known as a function processing module which is used to execute the function processing (e.g., encryption processing) of data, for the data security purpose. In the prior art, the function processing module of this type supports only one function algorithm. Even if it supports a plurality of function algorithms, one of them is selected for use, in response to an external switching control signal. Therefore, when a data processing apparatus of this type is fabricated as a module, it is necessary to ensure very reliable data security.
SUMMARY OF THE INVENTION
As has been described, the use of the hash function utilizing, for example, the conventional CBC mode results in an increase in the possibility of the occurrence of data collision. Therefore, a data processing apparatus adopting the hash function has to be so designed as to avoid the data collision, for ensuring data security. Where the data processing apparatus of this type is fabricated as a module, consideration has to be given to ensure more reliable data security.
The present invention has to be developed to solve the problems mentioned above, and the first object of the present invention is to provide a data processing apparatus which prevents data collision from occurring when data is subjected to compression/encryption processing, and which ensures reliable data security. The second object of the present invention is to provide a modularization technique which ensures the secrecy of data when the data processing apparatus of this type is fabricated as a module.
According to the present invention, there is provided a data processing apparatus comprising:
a block processing section (11) for dividing message data (B) into a plurality of blocks, so as to obtain a plurality of data blocks (B.sub.i (i=1 to m)); and
a plurality of data conversion processing sections (12.sub.i) which are provided in correspondence to the data blocks (B.sub.i) and each of which stores a plurality of data conversion algorithms therein, a first one of the data conversion processing sections selecting one (A.sub.i-1) of the data conversion algorithms in response to an initial selection control signal (S.sub.0) and each of remaining ones of the data conversion processing sections selecting one (A.sub.i-1) of the data conversion algorithms in response to a selection control signal (S.sub.i-1) supplied from a preceding data conversion processing section (B.sub.i-1), each of the data conversion processing sections (12.sub.i) performing data conversion processing with respect to the corresponding data block (B.sub.i) on the basis of the selected data conversion algorithm and generating a selection control signal used for processing a next data block (B.sub.i+1) on the basis of the data conversion processing.
Additional objects and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objects and advantages of the invention may be realized and obtained by means of the instrumentalities and combinations particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate presently preferred embodiments of the invention, and together with the general description given above and the detailed description of the preferred embodiments given below, serve to explain the principles of the invention.
FIG. 1 is a block circuit diagram showing a data processing apparatus according to the first embodiment of the present invention;
FIG. 2 is a block circuit diagram showing the configuration of a compression/encryption circuit employed in the first embodiment;
FIG. 3 is a block circuit diagram showing the configuration of a convolutional encoder which realizes the encryption algorithm determination method used in the first embodiment;
FIG. 4 is a trellis diagram corresponding to the operation of the convolutional encoder shown in FIG. 3;
FIG. 5 is a block circuit diagram showing a data processing apparatus according to the second embodiment of the present invention, the data processing apparatus being obtained by simplifying that of the first embodiment; and
FIG. 6 is a block circuit diagram showing the configuration of a general-purpose data processing module according to the third embodiment, the data processing module being applicable not only to the data processing performed by the apparatuses shown in FIGS. 1 and 5 but also to data processing of other kinds.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
The first embodiment of the present invention will now be described with reference to the accompanying drawings. The embodiment will be described, referring to the case where message data is subjected to compression/encryption processing by use of a hash function utilizing an improved and generalized CBC mode.
FIG. 1 shows the data processing apparatus employed in the embodiment. Referring to FIG. 1, a block processing section 11 divides input message data B into a plurality of blocks, and the resultant data blocks B.sub.i (i=1, 2, . . . , k+1, k+2, . . . , m) are output in parallel at appropriate time intervals. Each data block B.sub.i is supplied to the corresponding one of encryption processing circuits 12.sub.i.
The encryption processing circuits 12.sub.i are of the same configuration, and an initial parameter I.sub.0 (which can be used as a key) is determined for the first one 12.sub.1 of encryption processing circuits 12.sub.i. Each of the remaining encryption processing circuits 12.sub.i receives data block B.sub.i, and encrypts it on the basis of the processing result C.sub.i-1.sup.# (when i=1, C.sub.0.sup.# =I.sub.0) of the preceding processing circuit. The result of processing of the final processing circuit 12.sub.m is the compressed and encrypted data of message data B.
FIG. 2 shows the circuit configurations of the (k+1)th and (k+2)th ones of the encryption processing circuits 12.sub.i mentioned above. Referring to FIG. 2, the (k+1)th data block is supplied to an adder 1.sub.k+1. By this adder, the kth processing result C.sub.k.sup.# (when k= 0, C.sub.0.sup.# =I.sub.0) is added to the data block B.sub.k+1. The result of this addition is supplied to an encryption processor 2.sub.k+1. The encryption processor 2.sub.k+1 selects one of prestored N encryption function algorithms (hereinafter referred to as "encryption algorithms" or simply as "algorithms") A.sub.0 to A.sub.N-1, in response to a selection signal S.sub.k supplied from a kth algorithm selection controller, and encrypts the addition result of the adder 1.sub.k+1 by use of the selected algorithm.
The processing result C.sub.k+1 of the encryption processor 2.sub.k+1 is supplied to both a mask processor 3.sub.k+1 and a mask controller 4.sub.k+1.
Upon reception of the processing result C.sub.k+1, the mask controller 4.sub.k+1 identifies the history of the encryption algorithm executed by the encryption processor 2.sub.k+1 and stores the data obtained by the identification. Then, the mask controller 4.sub.k+1 determines a control value (. . . , b.sub.k, b.sub.k+1) dependent on the entirety or part of the encryption algorithm, and supplies the determined control value to the mask processor 3.sub.k+1.
Since the history of the encryption algorithm executed by the encryption processor 2.sub.k+1 can be stored as data in the encryption processor 2.sub.k+1, the mask controller 4.sub.k+1 may be supplied with the history data directly from the encryption processor 2.sub.k+1.
The mask processor 3.sub.k+1 performs mask processing with respect to the processing result C.sub.k+1 of the encryption processor 2.sub.k+1, such that the processing result C.sub.k+1 cannot be read or presumed afterwards. To be more specific, the entirety or part of the processing result C.sub.k+1 is replaced with other values on the basis of the control value (. . . , bk, b.sub.k+1) supplied from the mask controller 4.sub.k+1. The result C.sub.k+1.sup.# of the mask processing is supplied to the (k+2)th adder 1.sub.k+2.
The processing result C.sub.k+1 of the encryption processor 2.sub.k+1 is also supplied to an algorithm selection controller 5.sub.k+1. By this controller 5.sub.k+1, an encryption algorithm to be executed by a (k+2)th encryption processor 2.sub.k+2 is determined, using a statistical method which is dependent on both the encryption algorithm A.sub.k executed by the encryption processor 2.sub.k+1 and the values of the entirety or part of the processing result C.sub.k+1 obtained by the execution of the encryption algorithm A.sub.k. A selection signal S.sub.k+1 representing the determined encryption algorithm is supplied to the (k+2)th encryption processor 2.sub.k+2.
Just like the (k+1)th encryption processing circuit, the (k+2)th encryption processing circuit for performing encryption of data block B.sub.k+2 is made up of an adder 1.sub.k+2, an encryption processor 2.sub.k+2, a mask processor 3.sub.k+2, a mask controller 4.sub.k+2, and an algorithm selection controller 5.sub.k+2. The operations of these structural components are similar to those of the structural components of the (k+1)th encryption processing circuit.
The configuration and operation of each of the other encryption processing circuits (namely, the first through ith processing circuits and (k+3)th through m-th processing circuits) are similar to those mentioned above. Therefore, the configurations of the other encryption processing circuits are not shown in the drawings, and reference to the operations of them will be omitted herein. It should be noted that since each encryption processing circuit processes the data output from its preceding encryption processing circuit, the block processing section 11 has to supply data blocks B.sub.i to the respective encryption processing circuits with appropriate time delays.
The reasons why data collision can be prevented in the above-mentioned data processing apparatus will now be explained.
The compression/encryption procedures of message data are defined by the following formulas:
C.sub.k+1 =A.sub.k (C.sub.k.sup.# +B.sub.k+1) (1)
A.sub.k+1 =g(A.sub.k, �C.sub.k+1 !n) (2)
C.sub.k+1.sup.# =C.sub.k+1 +�b.sub.k-r+2 . . . b.sub.k b.sub.k+1 !(3)
where 0.ltoreq.k.ltoreq.(m-1).
Assuming that 1.ltoreq.i.ltoreq.(n+.alpha.) and r(n+.alpha.)=L, the following formulas are obtained:
�b.sub.k-r+2 . . . b.sub.k b.sub.k+1 !=�b.sub.k-r+2.sup.(i) . . . b.sub.k (i) b.sub.k+1.sup.(i) ! (4)
b.sub.k+1.sup.(i) =.beta.(.xi..sub.k+1 : A.sub.k .fwdarw.A.sub.k+1) (5)
When k=0 in these formulas, A.sub.0 denotes an arbitrarily-designated initial algorithm, and C.sub.0 # denotes an appropriate initial vector (initial parameter) I.sub.0.
what is meant by each of the above formulas (1)-(5) will be explained.
Where A.sub.k denotes the encryption algorithm executed by the (k+1)th encryption processing circuit, encrypted data C.sub.k+1 is derived from the processing result C.sub.k #of the kth encryption processing circuit and the present data block B.sub.k+1 by use of the encryption algorithm A.sub.k. (formula (1))
Then, an encryption algorithm A.sub.k+1 to be executed in the next encryption processing circuit (i.e., the (k+2)th processing circuit) is determined based on both n bits �C.sub.k+1 !n included in the encrypted data C.sub.k+1 (e.g., lower n bits of the encrypted data) and the encryption algorithm A.sub.k presently executed. (formula (2))
The encryption algorithm A.sub.k+1 to be executed in the next encryption processing circuit can be determined in various methods. One of the methods is a method wherein the n bits of the encrypted data C.sub.k+1 and the present encryption algorithm A.sub.k are used such that the temporal changes in the encryption algorithm form a finite-state discrete-time Markovian process.
To realize this method, the use of a trellis diagram of the convolutional codes of an encoding rate of n/(n+.alpha.) is effective. The trellis diagram is one of the representations of convolutional codes and is a kind of state transition diagram. The trellis diagram is featured in that all states are shown in relation to time.
FIG. 3 is a block circuit diagram showing the configuration of a general convolutional encoder, and FIG. 4 is a trellis diagram corresponding to the operation of the convolutional encoder. In the convolutional encoder shown in FIGS. 3 and 4, an encoded output of 2 bits is produced in response to an information input of 1 bit, so that the encoding rate is 1/2.
Referring to FIG. 3, a 1-bit information input is sequentially shifted by 1-bit shift registers SR.sub.1 and SR.sub.2. The 1-bit information input is added to the output of shift register SR.sub.1 by an adder AD.sub.1, to thereby obtain a signal y.sub.1. Also, the 1-bit information input is added to the output of shift register SR.sub.2 by an adder AD.sub.2, and the resultant signal is added to the output of register SR.sub.1 by an adder AD.sub.3, to thereby obtain a signal y.sub.2. Signals y.sub.1 and y.sub.2 are alternately output by means of a switch SW.
In FIG. 4, the states of registers SR.sub.1 and SR.sub.2 are shown in the vertical direction, and time k is shown in the horizontal direction. When information bit "1" is input in the state where k=0 and the contents of registers SR.sub.1 and SR.sub.2 are (00), the contents of registers SR.sub.1 and SR.sub.2 become (01) when k=1. This state transition is indicated by the broken lines.
In FIG. 4, an encoder output (11) is assigned to line segments corresponding to the state transitions. The line segments are generally referred to as "branches", and the encoder output (11) is often referred to as "branch codes".
When information bit "0" is input, the contents of registers SR.sub.1 and SR.sub.2 become (00). This state transition is indicated by the solid lines. The related encoder outputs <00> are assigned to the corresponding transition branches.
In the trellis diagram representation, a series of branches are referred to as a "path", and each of the paths extending from the left side to the right side of the trellis diagram corresponds to a code.
The convolutional codes mentioned above and the trellis diagram thereof are described in detail in A. J. Viterbi, Convolutional Codes and Their Performance in Communication Systems, IEEE Trans. Commun. Technol, vol. COM-19, No. 5, pp. 751-772, 1971.
When state A.sub.k in the trellis diagram subsequently changes to new state A.sub.k+1 in response to input of n bits (information bits), a new branch code represented by
b.sub.k+1.sup.(i) (1.ltoreq.i.ltoreq.n+.alpha.)
is produced. (formula (5)) By use of the past history of the branch codes including this new branch code (formula (4)), the entirety (or part) of the values of the history is replaced with other values dependent on the entirety (or part) of the history of the algorithms, thereby concealing the value of C.sub.k+1. The result obtained thereby is expressed as C.sub.k+1.sup.# (formula (3)).
A description will be given of the conditions under which data collision occurs. In view of the definitions, it is understood that data collision occurs when the hash values C.sub.m.sup.# and (C.sub.m ').sup.# of two different message data items M and M' coincide with each other. In the following, therefore, a description will be given of the condition under which the hash values coincide with each other.
The hash values C.sub.m.sup.# and (C.sub.m ') of the different message data items M and M' are represented by:
C.sub.m.sup.# =C.sub.m +�b.sub.m-r+1 b.sub.m-r+2 . . . b.sub.m !
(C.sub.m ').sup.# =C.sub.m '+�b.sub.m-r+1 'b.sub.m-r+2 ' . . . b.sub.m '!
Hence, the two hash values become equal to each other when the following two conditions are satisfied:
C.sub.m =C.sub.m '
�b.sub.m-r+1 b.sub.m-r+2 . . . b.sub.m !=�b.sub.m-r+1 ' b.sub.m-r+2 ' . . . b.sub.m '!
With the latter relationships in mind, the following conditions are initially determined:
A.sub.m-r =A.sub.m-r '
C.sub.m-r.sup.# +B.sub.m-r+1 =(C.sub.m-r ').sup.# +B.sub.m-r+1 '(6)
In this case, the following formula is obtained because of the assumption: ##EQU1##
Hence, the following formula is satisfied:
�C.sub.m-r+1 !.sub.n =�C.sub.m-r+1 '!.sub.n
Accordingly, the following two formulas are derived:
A.sub.m-r+1 =A.sub.m-r+1 '
b.sub.m-r+1 =b.sub.m-r+1 '
Next, let it be assumed that the condition represented below is satisfied:
C.sub.m-r+i.sup.# +B.sub.m-r+2 =(C.sub.m-r+1 ').sup.# +B.sub.m-r+2 '(7)
In this case, the following formula is obtained: ##EQU2##
Hence, the following formula is satisfied:
�C.sub.m-r+2 !.sub.n =�C.sub.m-r+2 '!.sub.n
Accordingly, the following two formulas are derived:
A.sub.m-r+2 =A.sub.m-r+2 '
B.sub.m-r+2 =b.sub.m-r+2 '
After similar procedures are repeated, the condition represented below is assumed:
C.sub.m-1.sup.# +B.sub.m =(C.sub.m-1 ').sup.# +B.sub.m ' (8)
In this case, the following formula is obtained: ##EQU3##
Hence, the following formula is satisfied:
�C.sub.m !.sub.n =�C.sub.m '!.sub.n
Accordingly, the following two formulas are derived:
A.sub.m =A.sub.m '
b.sub.m =b.sub.m '
At the time, the condition represented by the following formula is confirmed:
�b.sub.m-r+1 b.sub.m-r+2 . . . b.sub.m !=�b.sub.m-r+1 'b.sub.m-r+2 ' . . . b.sub.m '!
Hence, the following formulas are satisfied:
C.sub.m.sup.# =C.sub.m +�b.sub.m-r+1 b.sub.m-r+2 . . . b.sub.m !
(C.sub.m ').sup.# =C.sub.m '+�b.sub.m-r+1 ' b.sub.m-r+2 ' . . . b.sub.m '!
From these formulas, the following is obtained:
C.sub.m.sup.# =(C.sub.m ').sup.#
In view of the above, it is understood that the conditions under which data collision occurs are represented by the following four conditions:
A.sub.m-r =A.sub.m-r ' (11)
C.sub.m-r.sup.# +B.sub.m-r+1 =(C.sub.m-r ')#+B.sub.m-r+1 ' (12)
C.sub.m-r+1.sup.# +B.sub.m-r+2 =(C.sub.m-r+1 ').sup.# +B.sub.m-r+2 '(13)
C.sub.m-1.sup.# +B.sub.m =(C.sub.m-1 ').sup.# +B.sub.m ' (1r)
The condition for satisfying formula (11) will be considered. Since an algorithm changes in accordance with the trellis structure of a limited length (v.sub.0 =nv), the condition for satisfying formula (11) is the time when the following three formulas (21)-(2v) are satisfied simultaneously:
�C.sub.m-r-v+1 !.sub.n =�C.sub.m-r-v+1 '!.sub.n (21)
�C.sub.m-r-v+2 !.sub.n =�C.sub.m-r-v+2 '!.sub.n (22)
�C.sub.m-r !.sub.n =�C.sub.m-r '!.sub.n (2v)
Specifically:
�A.sub.m-r-v (C.sub.m-r-v.sup.# +B.sub.m-r-v+1)!.sub.n =�A.sub.m-r-v '{(C.sub.m-r-v ').sup.# +B.sub.m-r-v+1 '}!.sub.n (31)
�A.sub.m-r-v+1 (C.sub.m-r-v+1.sup.# +B.sub.m-r-v+2)!.sub.n =�A.sub.m-r-v+1 '{(C.sub.m-r-v+1 ')#+B.sub.m-r-v+2 '}!.sub.n (32)
�A.sub.m-r-1 (C.sub.m-r-1.sup.# +B.sub.m-r)!.sub.n =�A.sub.m-r-1 '{(C.sub.m-r-1 ').sup.# +B.sub.m-r '}!.sub.n (3v)
Assuming that the values up to the values of A.sub.m-r-v ' and (C.sub.m-r-v ').sup.# are known values, a description will be given as to how the values of B.sub.m-r-v+1 ' to B.sub.m-r ' that are factors of M' are determined.
First, the value of B.sub.m-r-v+1 ' is determined in such a manner as to satisfy formula (31). (It should be noted that the value of B.sub.m-r-v+1 ' cannot be determined without reference to the other values.) When the value of B.sub.m-r-v+1 ' is determined, values are determined in the order of C.sub.m-r-v+1 '.fwdarw.A.sub.m-r-v+1 '.fwdarw.(C.sub.m-r-v+1 ').sup.#, in accordance with the following formula:
C.sub.m-r-v+1 '=A.sub.m-r-v '{(C.sub.m-r-v ').sup.# +B.sub.m-r-v+1 '}
A.sub.m-r-v+1 '=g(A.sub.m-r-v ', �C.sub.m-r-v+1 '!.sub.n)
(C.sub.m-r-v+1 ').sup.# =C.sub.m-r-v+1 '+�......b.sub.m-r-v+1 '!
The portion "......" included in the �......b.sub.m-r-v+1 '! is specifically �......b.sub.m-r-v+1 'b.sub.m-r-v '! and is a value determined dependent on the past history of the algorithm " . . . .fwdarw.A.sub.m-r-v-1 .fwdarw.A.sub.m-r-v '". Since the value represented by
(C.sub.m-r-v ')#=C.sub.m-r-v '+�......b.sub.m-r-v-1 ' b.sub.m-r-v '! is a known value because of assumption, the value of the portion "......" included in the �......b.sub.m-r-v+1 '! can be regarded as being determinate. Therefore, if it is assumed that the values up to the value of (C.sub.m-r-v ').sup.# are known, the value of (C.sub.m-r-v+1 ').sup.# can be regarded as being determined based only on B.sub.m-r-v+1 '. After similar procedures are repeated, the value of B.sub.m-r ' is determined in such a manner as to satisfy formula (3v). As a result, values are determined in the order of C.sub.m-r '.fwdarw.A.sub.m-r '.fwdarw.(C.sub.m-r ').sup.#.
It should be noted that the value of (C.sub.m-r ').sup.# is dependent on the value of B.sub.m-r-v+1 ' determined at the beginning.
When the values up to the value of (C.sub.m-r ').sup.# have been determined, consideration can be made in relation to formulas (11) to (1r) indicated above. That is, if it is assumed that the values up to the values of A.sub.m-r-v ' and (C.sub.m-r-v ').sup.# are known, the formulas below are satisfied and data collision occurs:
�A.sub.m-r-v (C.sub.m-r-v.sup.# +B.sub.m-r-v+1)!.sub.n =�A.sub.m-r-v '{(C.sub.m-r-v ').sup.# +B.sub.m-r-v+1 '}!.sub.n (41)
�A.sub.m-r-v+1 (C.sub.m-r-v+1.sup.# +B.sub.m-r-v+2)!.sub.n =�A.sub.m-r-v+1 '{(C.sub.m-r-v+1 ').sup.# +B.sub.m-r-v+2 '}!.sub.n (42)
�A.sub.m-r-1 (C.sub.m-r-1.sup.# +B.sub.m-r)!.sub.n =�A.sub.m-r-1 '{(C.sub.m-r-1 ').sup.# +B.sub.m-r '}!.sub.n (4v)
C.sub.m-r.sup.# +B.sub.m--r+1 =(C.sub.m-r ').sup.# +B.sub.m-r+1 '(51)
C.sub.m-r+1.sup.# +B.sub.m-r+2 =(C.sub.m-r+1 ').sup.# +B.sub.m-r.-+.2 '(52)
C.sub.m-1.sup.# +B.sub.m =(C.sub.m-1).sup.# +B.sub.m ' (5r)
The satisfaction of these formulas is one of the sufficient conditions under which data collision occurs. In comparison with the CBC mode of data encryption, the above-noted condition under which data collision occurs is very strict. The number of the formulas representing the condition is (v+r), and it should be noted that the condition is expressed by not only the parameter v which controls the number of encryption algorithms but also the parameter r which is dependent on the history length of the encryption algorithm related to the concealment of encrypted data. In other words, the advantages of the above-noted condition is more than the advantages obtained by merely using a number of encryption algorithms.
As can be seen from the above detailed descriptions, the present invention is featured in two points. First, a plurality of encryption algorithms selectively used by the encryption processing circuits are not switched from one to another in response to a deterministic control signal; they are switched from one to another in a statistic method dependent on the result of the preceding encryption processing circuit. Second, the value obtained by the present-time encryption processing is concealed by use of a value or values dependent on the entirety or part of the past history of encryption algorithms before it is supplied to the next encryption processing circuit, to thereby leave no data suggestive of the control under which an encryption algorithm is changed.
Because of these features, it is practically impossible for a third party to know a series of encryption algorithms actually used in the hashing processing. In addition, since encrypted data is concealed by use of a value or values dependent on the entirety or part of the past history of the encryption algorithms, it is very difficult to prepare message data whose hash value coincides with that of the message data encrypted by the present invention.
In the embodiment mentioned above, the encryption processing circuit can be grouped into blocks such that each block is made by one encryption processing module. If, in this case, each encryption processing module is designed such that it executes both the determination of a new encryption algorithm to be used in the next module and the concealment of the data encrypted by the present-used encryption algorithm, the apparatus incorporating such modules can ensure very reliable data security.
Since the encryption processing circuits are the same in configuration the adder 1, encryption processor 2, mask processor 3, mask controller 4, and algorithm selection controller 5 of one processing circuit may be fabricated as one module, and this module may be repeatedly used for data blocks B.sub.1 to B.sub.m, as shown in FIG. 5. If this is done, the entire apparatus can be considerably simplified.
In the case shown in FIG. 5, the block processing section 11 divides message data B into data blocks B.sub.1 to B.sub.m and supplies the data blocks B.sub.1 to B.sub.m to the adder 1 on the time divisional basis. The processing result C.sub.i.sup.# of the mask processor 3 is fed back to the adder 1, and a selection signal S produced by the algorithm selection controller 5 is supplied to the encryption processor 2, so as to determine the encryption algorithm to be used subsequently.
Further, an output controller 6 is provided. When the mask processor 3 produces the processing output C.sub.m.sup.# corresponding to the last data block B.sub.m, the output controller 6 outputs the processing output C.sub.m.sup.# 0 a compressed and encrypted processing result. With this data processing, the apparatus can be very simple in configuration and yet the same operation similar as that of the case shown in FIG. 1 can be realized.
The technique for processing data by selectively using a plurality of function algorithms is not limited to the encryption processing described above; it is applicable to various kinds of data conversion. FIG. 6 shows an example of a general-purpose data processing module which can be applied not only to the data processing apparatuses shown in FIG. 1 and 5 but also to other types of data processors.
Referring to FIG. 6, a function processor 21 stores N function algorithms F.sub.0 to F.sub.N-1. The function algorithm executed by the function processor 21 is determined in response to a selection signal supplied from an algorithm selection controller 22. When function algorithm F.sub.k is selected, the function processor 21 carries out calculation F.sub.k (X)=Y with respect to input data X.
The function algorithm selection controller 22 receives the result of the calculation F.sub.k (X)=Y performed by the function processor 21. On the basis of the entirety or part of the received result, the function algorithm selection controller 22 determines function algorithm F.sub.k+1 to be subsequently executed by the function processor 21, and supplies a selection signal S to the function processor 21.
As described above, the function algorithm can be changed from F.sub.k to F.sub.k+1 in a variety of methods, and one of such methods is a statistic method wherein the temporal changes in the encryption algorithm are regarded as forming a finite-state discrete-time Markovian process. Needless to say, the function algorithm may be changed deterministically on the basis of calculation result Y.
According to the above configuration, the function algorithm to be used next is determined on the basis of the result of calculation performed by the function processor 21, and this determination process is carried out within the module. Therefore, a third party cannot understand which algorithm is being executed at each stage of the processing.
As indicated by the dotted lines in FIG. 6, the function algorithm may be changed in response to externally-input data X'. In this case, the algorithm selection controller 22 compares the calculation result F.sub.k (X) of the function processor 21 with the externally-input data X', and determines the next function algorithm F.sub.k+1 on the basis of the comparison. The function algorithm can be changed deterministically or statistically in this modification as well.
When putting the above modification into practice, the following control may be available. That is, when the comparison shows that F.sub.k (X) is equal to X', the present algorithm F.sub.k is maintained unchanged, and when the comparison shows that F.sub.k (X) differs from X', the present algorithm F.sub.k is changed to another algorithm F.sub.k+1.
According to the above configuration, the function algorithm is not designated directly by the externally-input data X' Therefore, a third party cannot know the processing performed inside the apparatus even when the function algorithm is externally selected or controlled.
In the embodiment shown in FIG. 6, the result of the calculation F.sub.k (X)=Y performed by the function processor 21 is not output as it is. In other words, it is masked in an output converter 23 by replacing it with other values, before it is output. Therefore, further reliable data security is ensured.
In the present invention, various data masking methods are available. In the case where the temporal changes in the algorithm form a finite-state discrete-time Markovian process, a method which uses a value B.sub.j (j.ltoreq.k) dependent on the history of the algorithms executed so far is applicable. That is, value Y is changed by use of the value B.sub.j as follows: Y'=Y+B.sub.j (j.ltoreq.k).
In the embodiment shown in FIG. 6, a mask controller 24 identifies the history of the past algorithms on the basis of the calculation result Y of the function processor 21, and calculates a value B.sub.j dependent on the history. With this value .sub.j supplied to the output converter 23, the masking processing mentioned above is performed.
Needless to say, the output conversion need not be performed by the mask controller 24. It may be carried out on the basis of fixed data stored in the output converter 23. In addition, if the function processor 21 is made to store data on the history of the function algorithm, the mask controller 24 may receive the history data directly from the function processor 21, as indicated by the dotted lines in FIG. 6.
The above embodiment was described, referring to the case where the function algorithms stored in the function processor 21 are independent of one another. However, this in no way limits the present invention. For example, one function algorithm may be a combination of one fundamental algorithm portion F and a plurality of sub algorithm portions G.sub.O to G.sub.N-1, and the entire algorithm may be changed by controlling only the sub algorithm portions G.sub.0 to G.sub.N-1. If this is performed, the function processor 21 need not have a large storage capacity to store the function algorithm, so that a reduction in the circuit scale can be attained easily, as in the case where the module is fabricated as a large scale integrated circuit.
In the above embodiment, the function processor 21 has only one input terminal. However, the present invention is not limited to this. As is indicated by the broken line in FIG. 6, an output of the output converter 23 may be fed back to the function processor 21.
The entire module need not be fabricated as a large scale integrated circuit. In other words, the function processor 21 may be divided into an algorithm storage section and an arithmetic processing section. In this case, an algorithm is read out from the algorithm storage section in response to a selection control signal supplied from the algorithm selection controller 22, and the readout algorithm is supplied to the arithmetic processing section. If the algorithm storage section designed such that the algorithms therein can be varied or a new algorithm can be to added thereto, then data security can be made further reliable, and the range of application of the embodiment can be widened.
Where the data processing module mentioned above is applied to the data processing apparatus shown in FIG. 5, the function processor 21 can be used as encryption processor 2; the algorithm selection controller 22, as algorithm selection controller 5; the output converter 23, as mask processor 3; and the mask controller 24, as mask controller 4. The data processing module is also applicable to the data processing apparatus shown in FIG. 1 in a similar manner.
The present invention is not limited to the embodiments described above. For example, the function algorithms are not limited to encryption algorithms mentioned above; they may be algorithms which are used for other kinds of data conversion. When the present invention is reduced to practice, it can be modified in various manners without departing from the spirit of the invention.
Additional advantages and modifications will readily occur to those skilled in the art. Therefore, the invention in its broader aspects is not limited to the specific details, and representative devices, shown and described herein. Accordingly, various modifications may be made without departing from the spirit or scope of the general inventive concept as defined by the appended claims and their equivalents.

Number	Date	Country	Kind
4-139424	May 1992	JPX
4-139425	May 1992	JPX

Number	Name	Date
4691355	Wirstrom et al.	Sep 1987
4782326	Bush	Nov 1988
5179591	Hardy et al.	Jan 1993
5185796	Wilson	Feb 1993
5199069	Barrett et al.	Mar 1993
5230020	Hardy et al.	Jul 1993
5253296	Castleberry, Jr. et al.	Oct 1993
5341427	Hardy et al.	Aug 1994

Data processing apparatus

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Abstract

Description

Claims

Priority Claims (2)

Parent Case Info

US Referenced Citations (8)

Foreign Referenced Citations (1)

Divisions (1)