Method and device for enciphering data to be transferred and for deciphering the enciphered data, and a computer system comprising such a device

• US 5,231,662 A
• Filed: 11/12/1991
• Issued: 07/27/1993
• Est. Priority Date: 08/01/1989
• Status: Expired due to Fees

• Current Assignee: Tulip Computers International B.V.
• Original Assignee: Tulip Computers International B.V.
• Inventors: van Rumpt, Herman W., Kwan, Benny C. T.
• Primary Examiner(s): Gregory, Bernarr E.
• Application Number:
  US07/794,326
• Time in Patent Office: 623 Days
• Field of Search: 380/9, 380/29, 380/33, 380/37, 380/49, 380/50
• US Class Current: 713/193
• CPC Class Codes: H04L 2209/12 Details relating to cryptographic hardware or logic circuitry
• CPC Class Codes: H04L 9/0618 Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation

Abstract

Method and device for enciphering data words of a word width of n bits, in particular data words to be written in a computer storage, wherein a product cipher circuit comprises alternately one from a plurality of permutation boxes with n inputs and n outputs and one from a plurality of substitution boxes with n inputs and n outputs, each of these boxes being under the control of a specific part of an m-bits key. In the product cipher circuit the data words are consecutively enciphered in whole and the enciphering device can be regarded as a delay line. The data words to be enciphered can be combined with coding words which depend on the specific sector of the computer storage, in particular a hard storage disk unit, where the data words are stored. The sector-specific coding words and/or the m-bits key can be combined with a key to be entered by a user.

Claims

1. A method of enciphering data comprising the steps of:

logically combining consecutive ones of a plurality of n-bit data words to be enciphered with an n-bit coding word so as to yield consecutive ones of resulting n-bit words;

varying a value of the n-bit coding word prior to logically combining the n-bit coding word with a next successive one of said n-bit data words to be enciphered in order to yield a corresponding one of the resulting n-bit words;

supplying consecutive n-bit words to a product cipher circuit;

modifying, in said product cipher circuit and under the control of an m-bit key, each one of said n-bit words a plurality of times in a corresponding plurality of consecutive modification stages of said product cipher circuit to yield a corresponding enciphered data word, wherein each of said modification stages and n and m are both pre-defined integers;

said modifying step comprising the step of;

successively and alternately permuting and substituting said each n-bit word a plurality of times under the control of said key.

2. The method according to claim 1 further comprising the step of deriving the n-bit coding word from an n-bit enciphered word appearing at the output of the cipher circuit.

3. The method according to claim 2 wherein the n-bit coding word is identical to the enciphered word.

4. The method according to claim 1 in which the n-bit data words are stored sectorwise in a storage device and further comprising the step of forming the resulting n-bit coding word from an r-bit coding word, the r-bit coding word being generated for each new sector to be written and being directed related to the sector into which the resulting n-bit data words, which are to be enciphered, are to be written, where r is a pre-defined integer having a value less than or equal to m.

5. The method according to claim 4 further comprising the step of determining the r-bit coding word in response to at least one of the following parameters:

a number of a read/write head in a disk unit having a plurality of hard disks, a side of a disk in the unit, a number of a track on the side and a number of the sector on the track.

6. The method according to claim 5 further comprising the step of forming the n-bit coding word by a logical combination of the r-bit coding word and a p-bit coding word, said p-bit coding word being entered by a user.

7. A method of deciphering enciphered data comprising the steps of:

supplying consecutive n-bit enciphered words to a product cipher circuit;

modifying, in said product cipher circuit and under the control of an m-bit key, each one of said n-bit enciphered words a plurality of times in a corresponding plurality of consecutive modification stages of said product cipher circuit to yield a corresponding one of a plurality of deciphered data words, wherein each of said n-bit enciphered words is modified only once by each one of said modification stages and n and m are both pre-defined integers;

said modifying step comprising the step of;

successively and alternately permuting and substituting said each n-bit enciphered word a plurality of times under the control of said key; and

said method further comprises the steps of;

logically combining consecutive ones of the deciphered words with an n-bit coding word so as to yield consecutive ones of n-bit deciphered data words; and

varying a value of the n-bit coding word prior to logically combining the n-bit coding word with a next successive one of said n-bit deciphered words in order to yield a current corresponding one of the n-bit deciphered data words.

8. The method according to claim 7 further comprising the step of deriving the n-bit coding word from the n-bit enciphered data word appearing at the input of the cipher circuit.

9. The method according to claim 8 wherein the n-bit coding word is identical to the enciphered data word.

10. The method according to claim 7 in which the n-bit enciphered data words are stored sectorwise in a storage device and further comprising the step of forming the n-bit coding word from an r-bit coding word, the r-bit coding word being generated for each new sector to be written and being directed related to the sector into which the n-bit enciphered data words, which are to be deciphered, are to be read, where r is a pre-defined integer having a value less than or equal to m.

11. The method according to claim 10 further comprising the step of determining the r-bit coding word in response to at least one of the following parameters:

a number of a read/write head in a disk unit having a plurality of hard disks, a side of a disk in the unit, a number of a track on the side and a number of the sector on the track.

12. The method according to claim 11 further comprising the step of forming the n-bit coding word by a logical combination of the r-bit coding word and a p-bit coding word, said p-bit coding word being entered by a user.

13. Apparatus for enciphering n-bit data words comprising:

a product cipher circuit, having as input signals consecutive n-bit words and an m-bit key, producing a sequence of corresponding enciphered n-bit data words and having alternately one from a plurality of permutation boxes with n inputs and n outputs and one from a plurality of substitution boxes with n inputs and n outputs, each of said permutation and substitution boxes being under the control of a specific part of the m-bit key, wherein each consecutive one of the n-bit words is permuted or substituted only once by each respective one of said permutation and substitution boxes and n and m are pre-defined integers; and

a modulo 2 adder wherein a first input to said adder receives n-bit data words to be enciphered, a second input to the adder is linked to the output of the product cipher circuit and receives the n-bit enciphered data words and the output of the adder is linked to and provides said n-bit words to an input of the product cipher circuit, wherein the adder logically combines each one of the n-bit enciphered data words produced by said product cipher circuit with a next successive one of said n-bit data words to be enciphered in order to yield a corresponding one of the n-bit words.

14. The apparatus of claim 13 further comprising switching means for linking at predetermined points in time the second input of the modulo 2 adder to a circuit which generates an n-bit initial coding word.

15. The apparatus of claim 14 further comprising means for forming the n-bit initial coding word from an r-bit coding word generated by a computer linked to the apparatus and a p-bit coding word entered by a user.

16. The apparatus in claim 15 further comprising a second modulo 2 adder wherein a first input of said second adder receives the r-bit coding word, a second input to said second adder receives an r-bit portion of the m-bit key and an output of said second adder is linked to a circuit for combining an r-bit output of the second adder and remaining m-r bits of the key to form the m-bit key to be supplied to the product cipher circuit.

17. Apparatus for deciphering n-bit enciphered data words comprising:

a product cipher circuit, having as input signals consecutive n-bit enciphered words and an m-bit key, for producing a sequence of corresponding deciphered n-bit data words and having alternately one from a plurality of permutation boxes with n inputs and n outputs and one from a plurality of substitution boxes with n inputs and n outputs, each of said permutation and substitution boxes being under the control of a specific part of the m-bit key, wherein each consecutive one of the n-bit enciphered words is permuted or substituted only once by each respective one of said permutation and substitution boxes and n and m are pre-defined integers; and

a modulo 2 adder wherein a first input to said adder is linked to the output of the product cipher circuit and receives the deciphered n-bit data words, a second input to the adder is linked to an input to the product cipher circuit and receives the enciphered n-bit data words to be deciphered and an output of the adder provides the deciphered n-bit enciphered data words, wherein the adder logically combines each one of the deciphered n-bit words produced by said product cipher circuit with a next successive one of said enciphered n-bit data words to be deciphered in order to yield a current corresponding one of the deciphered n-bit words.

18. The apparatus in claim 17 further comprising switching means for linking at predetermined points in time the second input of the modulo 2 adder to a circuit which generates an n-bit initial coding word.

19. The apparatus in claim 18 further comprising means for forming the n-bit initial coding word from an r-bit coding word generated by a computer linked to the apparatus and a p-bit coding word entered by a user.

20. The apparatus in claim 19 further comprising a second modulo 2 adder wherein a first input of said second adder receives the r-bit coding word, a second input to said second adder receives an r-bit portion of the m-bit key and an output of said second adder is linked to a circuit for combining an r-bit output of the second adder and remaining m-r bits of the key to form the m-bit key to be supplied to the product cipher circuit.

21. A computer system comprising:

a central processor;

a hard disk storage unit;

a bus linking the central processor and the disk storage unit; and

means, connected to said bus, for enciphering n-bit data words as said data words are transferred, along the bus, between said central processor and said hard disk storage unit, said enciphering means comprising;

a product cipher circuit, having as input signals consecutive n-bit words and an m-bit key, producing a sequence of corresponding enciphered n-bit data words and having alternately one from a plurality of permutation boxes with n inputs and n outputs and one from a plurality of substitution boxes with n inputs and n output, each of said permutation and substitution boxes being under the control of a specific part of the m-bit key, wherein each consecutive one of the n-bit words is permuted or substituted only once by each respective one of said permutation and substitution boxes and n and m are pre-defined integers;

a modulo 2 adder wherein a first input to said adder receives n-bit data words to be enciphered, a second input to the adder is linked to the output of the product cipher circuit and receives the n-bit enciphered data words and the output of the adder is linked to and provides said n-bit words to an input of the product cipher circuit, wherein the adder logically combines each one of the n-bit enciphered data words produced by said product cipher circuit with a next successive one of said n-bit data words to be enciphered in order to yield a corresponding one of the n-bit words; and

switching means for linking at predetermined points in time the second input of the modulo 2 adder to a circuit which generates an n-bit initial coding word.

22. The system in claim 21 wherein said enciphering means further comprising means for forming the n-bit initial coding word from an r-bit coding word generated by a computer linked to the apparatus and a p-bit coding word entered by a user.

23. The system in claim 22 wherein said enciphering means further comprises a second modulo 2 adder wherein a first input of said second adder receives the r-bit coding word, a second input to said second adder receives an r-bit portion of the m-bit key and an output of said second adder is linked to a circuit for combining an r-bit output of the second adder and remaining m-r bits of the key to form the m-bit key to be supplied to the product cipher circuit.

24. A computer system comprising:

a central processor;

a hard disk storage unit;

a bus linking the central processor and the disk storage unit; and

means, connected to said bus, for enciphering n-bit enciphered data words as said enciphered data words are transferred, along the bus, between said central processor and said hard disk storage unit, said deciphering means comprising;

a product cipher circuit, having as input signals consecutive n-bit enciphered words and an m-bit key, producing a sequence of corresponding deciphered n-bit data words and having alternately one from a plurality of permutation boxes with n inputs and n outputs and one from a plurality of substitution boxes with n inputs and n output, each of said permutation and substitution boxes being under the control of a specific part of the m-bit key, wherein each consecutive one of the n-bit enciphered words is permuted or substituted only once by each respective one of said permutation and substitution boxes and n and m are pre-defined integers;

a modulo 2 adder wherein a first input to said adder is linked to the output of the product cipher circuit and receives the deciphered n-bit data words, a second input to the adder is linked to an input to the product cipher circuit and receives the enciphered n-bit data words to be deciphered and an output of the adder provides the deciphered n-bit enciphered data words, wherein the adder logically combines each one of the deciphered n-bit words produced by said product cipher circuit with a next successive one of said enciphered n-bit data words to be deciphered in order to yield a current corresponding one of the deciphered n-bit words; and

switching means for linking at predetermined points in time the second input of the modulo 2 adder to a circuit which generates an n-bit initial coding word.

25. The system in claim 24 wherein said deciphering means further comprises means for forming the n-bit initial coding word from an r-bit coding word generated by a computer linked to the apparatus and a p-bit coding word entered by a user.

26. The system in claim 25 wherein said deciphering means further comprises a second modulo 2 adder wherein a first input of said second adder receives the r-bit coding word, a second input to said second adder receives an r-bit portion of the m-bit key and an output of said second adder is linked to a circuit for combining an r-bit output of the second adder and remaining m-r bits of the key to form the m-bit key to be supplied to the product cipher circuit.

27. A method of enciphering data comprising the steps of:

logically combining consecutive ones of a plurality of n-bit data words to be enciphered with an n-bit coding word so as to yield consecutive ones of resulting n-bit words;

varying a value of the n-bit coding word prior to logically combining the n-bit coding word with a next successive one of said n-bit data words to be enciphered in order to yield a corresponding one of the resulting n-bit words;

supplying consecutive n-bit words to a product cipher circuit;

modifying, in said product cipher circuit and under the control of an m-bit key, each one of said n-bit words a plurality of times in a corresponding plurality of consecutive modification stages of said product cipher circuit to yield a corresponding enciphered data word, wherein n and m are both pre-defined integers;

said modifying step comprising the step of;

successively and alternately permuting and substituting said each resulting n-bit word a plurality of times under the control of said key.

28. The method according to claim 27 wherein the n-bit coding word is identical to the enciphered word.

29. The method according to claim 27 in which the resulting n-bit data words are stored sectorwise in a storage device and further comprising the step of forming the n-bit coding word from an r-bit coding word, the r-bit coding word being generated for each new sector to be written and being directed related to the sector into which the resulting n-bit data words, which are to be enciphered, are to be written, where r is a pre-defined integer having a value less than or equal to m.

30. The method according to claim 29 further comprising the step of determining the r-bit coding word in response to at least one of the following parameters:

a number of a read/write head in a disk unit having a plurality of hard disks, a side of a disk in the unit, a number of a track on the side and a number of the sector on the track.

31. The method according to claim 30 further comprising the step of forming the n-bit coding word by a logical combination of the r-bit coding word and a p-bit coding word, said p-bit coding word being entered by a user.