GB2329096A

GB2329096A - Creating sub-keys from hashed cryptographic master key

Info

Publication number: GB2329096A
Application number: GB9718200A
Authority: GB
Inventors: Ian Nigel Harvey; Someren Nicholas Benedict Van
Original assignee: nCipher Corp Ltd; nCipher Ltd
Current assignee: nCipher Corp Ltd; Thales Reading 1 Ltd
Priority date: 1997-08-29
Filing date: 1997-08-29
Publication date: 1999-03-10
Also published as: WO1999012309A1; EP1008251A1; ZA986026B; GB9718200D0; AU8450198A

Abstract

A facitity for enhancing data security comprises a plurality of encryption modules, an interface and a data processing machine (10). The encryption modules are each responsible to a sub-key for encrypting data. The interface is operative to receive a master key, and the data processing machine (10) is operative to create a series of sub-keys for use with the modules. The machine (10) is operative to create each of the sub-keys by means of a hash function of the master key.

Description

Title: This invention is concemed with data security, and in particular to the security of data transferred in the course of commercial activities such as banking.

In the field of banking, data is transferred along data carriers in such a manner that a data stream can be intesw by an unauthorised person. Hence, there is a need to disguise the data so that it can only be comprehended by the intended and authorised user.

In one method of disguising data, a cryptographic cipher system is used. If data is to be sent between a sender and a recipient along a channel which is of questionable security, then it is encrypted using a cipher implemented by the system.

Most ciphers require a secret "master key" to be shared between sender and recipient. In many systems, the master key is used by the cipher to generate a plurality of sub-keys which are used by internal fimctions of the cipher in the encryption process.

In the past, sub-keys have been derived either by re-ordering selected bits of the key data or by using a simple mathematical function such as an arithmetic progression.

The type of system described above is lacking in versatility, in that it expects a master key of a predetermined length, and cannot accommodate master keys of different lengths. It cannot deal with the generation of a variable number of sub-keys, which would improve security.

Furthermore, where there is a simple relationship between two master keys used with the above system, there may be a correspondingly simple relationship between the sets of sub-keys so produced. That relationship could easily be found by a cryptanalyst, and the security of a system protected in that manner could be compromised.

It is an object of the present invention to provide a system which ameliorates the above problems.

According to the invention there is provided a facility for enhancing data security, the facility comprising a plurality of encryption modules each being responsive to a sub-key for encrypting data, an interface for receiving a master key, and a data processing machine operative to create a series of sub-keys for use with the modules, the machine being operative to create each of the sub-keys by means of a hash function of the master key.

In that way, the series of sub-keys corresponding to a master key will not be evident to an unauthorised user.

Preferably, the hash function operates on a concatenation of the master key with at least one other piece of data. Therefore, the complexity of the result of the hash function is substantially increased which makes it more difficult for a pattem between the sub-keys and master key to be established.

The other data may comprise at least one of a constant, the position of the sub-key in the series, a function of the position of the sub-key in the series, preceding sub-keys in the series, and a function of preceding sub-keys in the series.

In a preferred embodiment of the invention, the concatenation comprises a first string of other data preceding the master key and a second string of other data following the master key, at least one of the first and second strings varies with the position in the series of the sub-key being calculated. In that way, the security of the cipher defined by the series of sub-keys is enhanced.

The hash function is preferably a one way hash function. In a preferred embodiment, the hash function is collision free.

In a preferred embodiment of the invention, the data processing machine derives the sub-keys of the series and then stores the series for later use by the sections.

Alternatively, the sub-keys are derived as they are required by the sections.

Preferably, the sub-keys are derived in the order in which they are to be used.

In a preferred embodiment of the invention, the hash function produces results the same length as the desireFlengtll of hash key. Alternatively, if the hash function results are shorter than the desired length of sub-key, then a sub-key can be constructed from a concatenation of hash function results. Furthermore, if the hash function results are longer than the desired length of sub-key, then more than one sub-key could be derived from a hash function result.

Further preferred aspects and features of the invention will be appreciated from the following description of a specific and preferred embodiment of the invention, with reference to the drawing appended hereto which shows a schematic diagram ilustrating the function of a data processing machine contained in a cryptographic system in accordance with the invention.

A cryptographic system comprises n sections, each acting on target data in response to a sub-key supplied to that section. Hence, the system as a whole is operated by a key schedule comprising a set of n sub-keys i (K,,K2 K,J.

The figure illustrates a sub-key data processing machine 10 having a series of interconnected modules.

A counter 12 generates a counter signal having value between I and n, where n is the number of sections of the system and thus the number of sub-keys to be generated.

A prefix generator 14 and a suffix generator 16 are provided, the generators 14, 16 being operative to generate values S, and Tj respectively.

Si, Tt, and a master key K are fed forward to a concatenation module 18 where the data is concatenated, and then the concatenated data is fed to a hash function module 20 A key schedule is derived from the master key K, by means of a hash function embodied in the hash function module 20 as follows: Kj=H(SilKl Ti) 1 # i # n, where HO is a hash function, the l symbol represents concatenation of data and Si and Ti are generated in the prefix and suffix generators 14, 16 as indicated above. S and Ti may be constructed from some or any of: (1) a constant value; (2) the value i; (3) a function of the value i; (4) any of the values Kl, ,Kj ,; (5) a function of the values Kj, ,Kj .

The sub-keys are used in order, so that the first use of Ki is after the first use of each of K, ...,KI This is an optional arrangement which allows sequential production of sub-keys, such as in the case where a sub-key is a function of preceding sub-keys. As shown in the drawing, the result output by the hash function module 20 is fed back to the prefix and suffix generators 14, 16 so that they can utilise the result in later iterations. The machine can thus derive each sub-key as it is needed. However, it may be more useful for the machine to derive all of the sub-keys at an initial stage and store them in tum for later use.

In some cases, the length of the sub-keys required for the sections of the system is less than the length of the output of the hash function. In that case, the result of each hash operation can be used to make more than one sub-key. If the length of the sub-key required is greater than the length of the output of the hash function, the outputs of several hash operations can be concatenated to construct the sub-key.

In order to ensure that the key schedule is "strong", i.e. that it is not susceptible to deciphering, at least one of S1 and Tri varies with the value of i.

For optimal security, the hash function HO should be chosen to be one way and collision free.

The system described above is useful in that it is capable of defining a master key of arbitrary length. Moreover, a variable number of sub-keys of variable length can be generated from each master key. The system avoids "weak" keys from which a pattern can be derived easily, and is generally more robust against cryptanalysis than previous encryption systems, since there is no simple relationship between sub-keys generated from master keys which have a simple relationship.

Claims

1. A facility for enhancing data security, the facility comprising a plurality of encryption modules each being responsive to a sub-key for encrypting data, an interface for receiving a master key, and a data processing machine operative to create a series of sub-keys for use with the modules, the machine being operative to create each of the sub-keys by means of a hash function of the master key.

2. A facility in accordance with claim 1 wherein the hash function operates on a concatenation of the master key with at least one other piece of data.

3. A facility in accordance with claim 2 wherein the other place of data comprises at least one of a constant, the position of the sub-key in the series, a function of the position of the sub-key in the series, preceding sub-keys in the series, and a function of preceding sub-keys in the series.

4. A facility in accordance with claim 2 or claim 3 wherein the concatenation comprises a first string of other data preceding the master key and a second string of other data following the master key, at least one of the first and second strings varies with the position in the series of the sub-key being calculated.

5. A facility in accordance with any preceding claim wherein the hash function is a one way hash function.

6. A facility in accordance with claim 5 wherein the hash function is collision free.

7. A facility in accordance with any preceding claim wherein the data processing machine derives the sub-keys of the series and then stores the series for later use by the sections.

8. A facility in accordance with any one of claims 1 to 6 wherein the sub-keys are derived as they are required by the sections.

9. A facility in accordance with claim 7 or claim 8 wherein the sub-keys are derived in the order in which they are to be used.

10. A facility in accordance with any preceding claim the hash function produces results the same length as the desired length of sub-key.

11. A facility of enhancing data securing as described with reference to the accompanying drawing.