|Publication number||US3700806 A|
|Publication date||Oct 24, 1972|
|Filing date||Sep 18, 1967|
|Priority date||Sep 18, 1967|
|Publication number||US 3700806 A, US 3700806A, US-A-3700806, US3700806 A, US3700806A|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (1), Referenced by (14), Classifications (11)|
|External Links: USPTO, USPTO Assignment, Espacenet|
United States Patent Vasseur 5] Oct. 24, 1972  KEY GENERATORS FOR CRYPTOGRAPHIC DEVICES  Inventor:
 Assignee: CSF-Compagnie Telegraphie sans Fil 22 Filed: Sept. 18, 1967 211 Appl.No.: 668,447
Jean-Pierre Vasseur, Paris, France Generale de  US. Cl ..178/22, 331/78  Int. Cl. ..H04l 9/04  Field of Search ..178/22; 35/2; 331/78  References Cited UNITED STATES PATENTS 3,515,805 6/1970 Fracassi et al. ..l78/22 at h ab 14 Lam $74655 LOG/04L C/RC'l/lr Primary Examiner-Benjamin A. Borchelt Assistant Examiner-11. A. Birmiel Attorney-Cushman, Darby & Cushman ABSTRACT 5 Claims, 5 Drawing Figures emu-rm sues l PATENTED 0U 24 I97? 3. 700.806
SHEET 3 BF 3 PERMUTATOE PERHUrATOR 105 107, 108,109: DECODlNG'PEPHUTAT/NG- coo CIRCUITS KEY GENERATORS FOR CRYPTOGRAPI-IIC DEVICES The present invention relates to key generators for cryptographic links, wherein the transmission intelligence is effected in the following way:
Each intelligence element, a latter for example, is first coded into a number I; for each of those intelligence elements, a device, known as a key generator, supplies a key C, i.e., another number, building up a one-element key, or a sequence of several numbers, each of which is an element of the key; a ciphering apparatus supplies an enciphered intelligence element I which is a function of C and I, such that I may be recovered from C and I. To this end, at the receiver, a key generator, identical to that of the transmitter, and synchronized therewith, supplies the key C when the ciphered intelligence element I is received.
From this mode of operation results that the two identical key generators, starting from the same state, will supply the same sequence of keys, strictly determined by their identical structure;further, this sequence will necessarily have a given period, i.e., will repeat itself after a predetermined number of keys.
However, the secrecy requirements imply that each key should appear as unexpected as possible, which is expressed by saying that the key must be of a quasirandom nature. This involves various desired conditions, such as a very long period, within which the various numbers which can build up the key or each of the key elements appear about the same numbers of times (equiprobability of the keys).
Very complex key generators have been proposed to this end, in particular, key generators are known wherein a number, already of a quasi-random nature and which will be referred to here as a primary number, is first elaborated; the primary number is thereafter again handled so as to increase its quasirandom character, the transformed number thus obtained, which will be referred to as a secondary number, either building up the ultimate key C or anelement thereof, or being again handled with a view towards elaborating the key.
In the same way, it will be noted that the primary number," as understood here, may itself result from the handling of one or more previous quasi-random numbers, and is necessarily primary only with respect to the corresponding secondary number.
The primary number also has a periodic character, the period of the corresponding secondary number of being generally much longer.
The present invention concerns more particularly key generators of the following type: they comprise a clock; a stage of counters controlled by the clock, at least some of the outputs of those counters being connected to the inputs of a logical circuit, which, generally, does not include any memory device; the outputs of the logical circuit respectively supply the 11 digits of a quasi-random number, which is a primary number as understood here.
The applicant has previously proposed to have this logical circuit followed by another circuit, comprising auxiliary counters, the outputs of which supply a corresponding secondary number.
The present invention provides for a higher improvement of the quasi-random character of a primary number, expressed in a system whose base is b, b being a positive integer higher than I, through the use of shift registers, and more precisely, of shaft register arrangements of the type, comprising: a shift register, each stage of which has b stable states; a modulo b adder, which will be referred to as the input adder, whose first input builds up the input of the arrangement, and whose output in connected to the input of the shift register, and a network of modulo b adders and/or other logical operators, inserted in series with the stages of the register, and/or coupled in parallel with these stages, the output of this network being coupled to the second input of the input adder. The output of the arrangement may be placed at various points thereof, and in particular at the output of the input adder.
A shift register arrangement of the hereinabove described type will be hereinafter, and in the claims, referred to as a modulo b shift register converter.
According to the invention, there is provided a key generator for supplying a key to the enciphering apparatus of a cryptographic link, said key generator comprising: a clock; a network of counters; said counters having outputs and being controlled by said clock; a logical circuit having inputs coupled to a least some of the outputs of said counters, and n outputs, referred to as the primary outputs, for respectfully supplying the n digits of a quasi-random number, expressed in a system whose base is b; and an output circuit having outputs designed to be coupled to said enciphering apparatus, said output circuit comprising at least a converting circuit having p outputs, referred to as the secondary outputs, for converting said quasi-random number into another quasi-random number of p digits expressed in said system of base b, said p digits being respectively supplied by said p secondary outputs; n, b and p being positive integers, and b being greater than 1; wherein said converting circuit comprises q modulo b shift register converters, q being a positive integer not greater than n, said q shift registers converters having respective inputs respectively coupled to q of said n primary outputs, and each of said converters having an output building up one of said p secondary outputs.
The invention will be best understood, and other characteristics thereof will appear, from the following description and appended drawing, wherein:
FIG. 1 is the block circuit of one embodiment of a key generator according to the invention; and
FIGS. 2, 3, and 4 are various embodiments of the shift register converters of the circuit of FIG. 1.
FIG. 5 shows a detailed embodiment of the counters and logical circuit stages of the block circuit of FIG. 1.
In the Figures, the same reference numbers are used to designate the same elements.
The invention will be described, in a non-limitative way, in the case of a key generator operating in a parallel binary code.
In FIG. 1, a clock 2 has an output connected to a circuit 1 comprising a plurality of counters, whose maximal counts differ between them, these counters being controlled by the signals supplied by clock 2 for each step thereof. The N outputs of circuit 1 are respectively connected to the N inputs of a logical circuit 3, comprising elements such as decoders, permutators, coders and gate, this logical circuit having n outputs 7.
For each step of the clock, N binary digits appear respectively on the N outputs of circuit 1, and as a consequence n binary digits also appear on the n outputs 7 respectively; these n binary digits, each of which has a quasi-random character, build up a quasi-random binary number, which is the primary number considered here, the n outputs 7 being the primary outputs.
The assembly built up by the circuits 1 and 3 may for example comprise the parts I to 4 and 10 to 33 of the circuit shown in FIG. 2 of US. Pat. No. 3,250,855, the primary outputs being the outputs of the gates 19 to 21, 23 to 25, 29 to 31 and 31 to 33 of this figure; or else may be as illustrated in FIG. 1 of the French Addition Patent No. 79,634 the primary terminals being then the outputs of the circuit of this last mentioned figure.
FIG. corresponds to the latter example. Block 1 of FIG. 1 is formed by three binary counters 102 to 104, having inputs feed in parallel by an output of clock 2, and the respective maximum counts of which are 61, 59 and 31. A circuit 105, which is a decoding-permutating-coding circuits, i.e. includes a decoder followed by a permutator itself followed by a coder, the latter coding again in a binary system the permutated decoded signal delivered by the permutator, has four inputs, three of which are respectively connected to one output of each of the counters. Two further outputs of counters 102, and a further output of each one of the counters 103 and 104 are unconnected. The remaining outputs of the three counters are connected to inputs of a permutator 106 having 16 inputs and 16 outputs, the other 6 inputs of the permutator being connected to 6 outputs thereof by respective feedback loops, this sextuple connection being shown in the drawing by a single loop with an arrow. Two of the other 10 outputs of permutator 106, are unconnected, one feeds the fourth input of circuit 105.
The logical circuit comprises three further decodingpermutating-coding circuits 7, 8 and 9, each having four inputs which are fed as follows:
As concerns circuits 109 and 108, two of their inputs are fed by two outputs of permutator 106, one by an output of circuit 105, and one by an output of circuit 107, the other two outputs of which are unconnected.
Three of the inputs of circuit 107 are fed by permutator 106, and one by circuit 105, the last output of which is unconnected.
Finally, a permutator 110 with 16 inputs and 16 outputs has eight of its outputs connected to eight of its inputs by respective feedback loops, this being again shown by a single loop with an arrow, the remaining eight inputs being connected to the four outputs of circuit 108 and to the four outputs of circuit 109, while the remaining eight outputs of permutator 110 are the outputs of the logical circuit 3 of FIG. 1.
The permutators of the circuit are adjustable permutators whose internal connections determining a oneto-one correspondency between the inputs and the outputs thereof may thus be changed from time to time, according to a given program.
In this preferred embodiment of the invention, each output of circuit 3 is connected to the signal input of a modulo 2 shift register converter 4, having an advance input 6 connected to clock 2, and an output building up one secondary output, and also one of the outputs of the key generator.
The output signals of the circuit 3 are applied to the inputs of the converters 4, and cause other signals, which depend in a quasi-random way on the corresponding digits of the primary number, to be displayed on the outputs of the converters.
FIG. 2 shows an embodiment of the converters 4 of FIG. 1.
The converter 4 comprises a conventional shift register, having a number of stages 10, each of which has its output connected to the input of the following one. Each stage 10 has two stable states.
Modulo 2 adders, 11, are connected to give the sum S of the signals stored by a predetermined group of the stages of the register. To this end, the first one of those adders 11 receives the signals of the last two stages of this group, and each of the other adders 1 1 receives the output signal of the preceding adder and the signal stored by the preceding stage of the group, the output of the last adder 11 being connected to the second input 12 of another modulo 2 adder, 14, whose output is connected to the input of the first stage of the register. The first input of the input adder 14, which is the input of the converter, is connected to the corresponding output 7 of circuit 3. The output of the adder 14 is also connected to the output 5 building up the output of the converter.
In this Figure, the conventional connections between the various stages of the register and the advance input 6 thereof (FIG. 1) have not been shown.
The operation of the converter is as follows:
a. Assuming that the system includes only the stages 10 of the register, it is known that a digit appearing at the input thereof is stored by the input stage of the register, erasing that which it contained previously. The latter is forwarded to the next stage, and so on. Thus a digit successively goes through all the stages of the register, under the control of the advance pulses supplied by the clock 2 (FIG. 1);
b. Assuming the converter to operate in the autonomous way, i.e., in cooperation with adders 1 1 and 14, but terminal 7 constantly receiving a zero signal, it is known that the period of the register, starting of course from an initial state other than 0 in each stage of the register, can, through an adequate choice of the network of adders 11 for forming the sum modulo 2, S, reach the maximal value 2"1 where K is the number of stages in the register. Preferably, this network will be designed in this way. (To this end, the tables of appendix C of the work of W. Wesley Peterson, Error-Correcting codes, John Wiley and Sons may be used.)
c. But actually, the register will operate in a much more complicated way, due to the fact that a quasirandom digit is applied to the first input 7 of adder 4 before the apparition of each advance clock pulse.
It is thus seen that the output digit of the converter is an intricate function of the digit applied to input 7 of the converter, and of the digits previously applied thereto.
A remarkable advantage of the use of such converters in the key generator according to the invention will appear from a comparison between the conversions respectively effected on the one hand by a converter having the period P 2"-l (when it operates in an autonomous way) and a counter, having the same period P.
In both cases, e, will designate here, in a general way, the 1''" binary digit applied to the input of the converter or of the counter, and s, the i"' output signal supplied by either, it being understood that, as concerns the counter, s, will be a k digit number such that 2" P.
In the case of the counter, the r'" output signal s,, will obviously always result, whatever r, from the law i=r s,=2 e modulo P But, as concerns the converter, experience indicates, and theoretical considerations confirm, that P successive output signals, s, to S +p are formed according to P different laws as a function of the corresponding input signals (considered starting from the first one) and the preceding input signals.
This fact is of course of great advantage as concerns the secrecy requirements.
It should be noted that an advantage of this kind would not obtain if a shift register with a feedback circuit, but operating in the autonomous way (in other words an apparatus such as shown in FIG. 2, but wherein the input 12 would be directly connected to the input of the shift register) were used to generate a quasi-random sequence with the period P directly.
Of course, the output digit may be picked up not only at the input of the first stage of the register, as shown in FIG. 2, but also at the input or output of any stage thereof.
Further, the key generator being provided with a plurality of converters 4, the laws according to which the output digits of each converter are formed depend upon the length of the register and the corresponding network of adders. Thus a different design may be advantageously chosen for each converter, which will make each secondary number a very intricate function of the corresponding primary number and of the preceding ones.
FIG. 3 shows another embodiment of the converter 4, wherein an adder 15 is serially inserted between two stages of the shift register.
FIG. 4 shows a third embodiment of the converter, wherein the outputs of each stage are connected to a device 16, which effects on its inputs signals a predetermined logical operation, supplying the signal S, which is added in 14 to the signal displayed on terminal 7.
It can be shown that, in this case, it is possible to devise a converter with any period up to 2" (cf Counting with non-lineary binary feedback registers,l.E.E. Transaction on Electronic Computers, Aug. 12, 1963, p. 357).
Of course the invention is not limited to the embodiments described and shown.
In this respect is should be noted, in particular, that it may be applied to a key generator wherein the primary and secondary quasi-random numbers are generated serially, in which case a single converter is required.
0n the other hand, the invention also applies if the base b of the system, in which this primary and secondary quasi-random numbers are expressed, is greater than 2. The converters should then be modulo b converters, which involves that each stage of the registers has b stable states, and that the adders or other lo 'cal operators of the converters are modulo b opera ors.
However, for technological reasons, it is generally preferred to use a binary code.
Lastly it should be understood that the terms input or output used here for an input or output receiving or supplying a digit, of course allude to an input or an output comprising the single or several wires used to express this digit. It is known for example that an input for receiving a binary digit may be built up either by a single wire or by two wires with corresponding energization codes.
What is claimed is:
1. A key generator for supplying a key to the enciphering apparatus of a cryptographic link, said key generator comprising: a clock; a network of counters, said counters having outputs and being controlled by said clock; a logical circuit having inputs coupled to a least some of the outputs of said counters, and n outputs, referred to as the primary outputs, for respectfully supplying the n digits of a quasi-random number, expressed in a system whose base is b, and an output circuit having outputs designed to be coupled to said enciphering apparatus, said output circuit comprising at least a converting circuit having p outputs, referred to as the secondary outputs, for converting said quasi-random number into another quasi-random number of p digits expressed in said system of base b, and p digits being respectively supplied by said p secondary outputs; n, b, and p being positive integers, and b being greater than one; wherein said converting circuit com prises q modulo b shift register converters, q being a positive integer not greater than n, said q shift registers converters having respective inputs respectively coupled to q of said n primary outputs, and each of said converters having an output building up one of said p secondary outputs.
2. A key generator as claimed in claim 1, wherein b 3. A key generator as claimed in claim 1, wherein q 4. A key generator as claimed in claim 1, wherein said q converters have different structures.
5. A key generator as claimed in claim 2, wherein the period P of each of said converters is equal to P 2"l K being the number of the stages thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US3515805 *||Feb 6, 1967||Jun 2, 1970||Bell Telephone Labor Inc||Data scrambler|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US3911216 *||Dec 17, 1973||Oct 7, 1975||Honeywell Inf Systems||Nonlinear code generator and decoder for transmitting data securely|
|US3920894 *||Mar 11, 1974||Nov 18, 1975||Bell Telephone Labor Inc||Pseudo-random parallel word generator|
|US4115657 *||Nov 11, 1976||Sep 19, 1978||Datotek, Inc.||Random digital code generator|
|US4320513 *||May 11, 1972||Mar 16, 1982||Siemens Aktiengesellschaft||Electric circuit for the production of a number of different codes|
|US4785410 *||Jun 2, 1986||Nov 15, 1988||Clarion Co., Ltd.||Maximum length shift register sequences generator|
|US5245659 *||Nov 17, 1978||Sep 14, 1993||The United States Of America As Represented By The Director, National Security Agency||Constant ratio coding for multipath rejection and ECCM enhancement|
|US5268949 *||Aug 31, 1992||Dec 7, 1993||Ando Electric Co., Ltd.||Circuit for generating M-sequence pseudo-random pattern|
|US5351301 *||Mar 3, 1980||Sep 27, 1994||The United States Of America As Represented By The Director Of National Security Agency||Authenticator circuit|
|US5432853 *||Mar 15, 1994||Jul 11, 1995||Mitsubishi Denki Kabushiki Kaisha||Digital signal processing system|
|US5995629 *||Aug 15, 1997||Nov 30, 1999||Siemens Aktiengesellschaft||Encoding device|
|US6510228 *||Sep 22, 1997||Jan 21, 2003||Qualcomm, Incorporated||Method and apparatus for generating encryption stream ciphers|
|US6590981 *||Feb 22, 2000||Jul 8, 2003||Zyfer, Inc.||System and method for secure cryptographic communications|
|US20060098816 *||Nov 7, 2005||May 11, 2006||O'neil Sean||Process of and apparatus for encoding a signal|
|USRE30957 *||Jun 30, 1980||Jun 1, 1982||International Business Machines Corporation||Variant key matrix cipher system|
|U.S. Classification||380/46, 331/78, 380/265|
|International Classification||H04L9/22, G06F7/58, H04L9/18|
|Cooperative Classification||H04L9/22, G06F7/584, G06F2207/581|
|European Classification||H04L9/22, G06F7/58P1|