← Back to Patent Explorer
US4797922A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of, and apparatus for, transforming a digital data sequence into an encoded form

Assignee: SAFEWARE AG
•
Filing: 1985-10-28
•
Granted: 1989-01-10
•
Expires: 2005-10-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A converter or running-key for generator producing pseudo-random sequences under the supervision of a secret or confidential key or code is substantially formed by a combination device containing a memory circuit and a feedback circuit. Periodic digital sequences are summed in an adder circuit, and the thus obtained composite digital sequence is separated in a divider circuit. A part of this composite digital sequence is used as a digital feedback sequence which is fed to an input of the same adder circuit through the feedback circuit comprising an auxiliary digital memory device or storage and an auxiliary logic circuit. In this manner, the desired memory and feedback is achieved which results in more complicated or complex pseudo-random sequences. In an advantageous exemplary embodiment, a substitution block is inserted as the auxiliary digital memory device or storage. This substitution block can be implemented by a commercially available read-and-write memory (RAM).

Inventors

  • 👤 James L. Massey
  • 👤 Rainer A. Rueppel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 21:19
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L9/0668; H04L2209/00; H04L2209/12

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 167 words
Apparatus for generating a complex first pseudo-random digital sequence, said apparatus comprising: (a) generating means for generating at least second and third periodic, pseudo-random digital sequences; (b) summing means for receiving as inputs at least said second and third periodic, pseudo-random digital sequences and an auxiliary digital sequence for providing an output as a digital sum of said inputs, said digital sum output comprising a sequence of pluralities of bits, each of said pluralities of bits forming the integer sum of the corresponding bits of at least said second and third pseudo-random digital sequences and of said auxiliary digital sequence, each of said pluralities of bits comprising a selected one bit and the remaining bits, a sequence of said selected one bits forming said first pseudo-random digital sequence, and (c) feedback means for receiving and feeding back said remaining bits as said auxiliary digital sequence to said summing means, whereby said first pseudo-random digital sequence is rendered more complex than said second and third pseudo-random digital sequences.
Claim 2
Dependent Claim 167 words
Apparatus for generating a complex first pseudo-random digital sequence, said apparatus comprising: (a) generating means for generating at least second and third periodic, pseudo-random digital sequences; (b) summing means for receiving as inputs at least said second and third periodic, pseudo-random digital sequences and an auxiliary digital sequence for providing an output as a digital sum of said inputs, said digital sum output comprising a sequence of pluralities of bits, each of said pluralities of bits forming the integer sum of the corresponding bits of at least said second and third pseudo-random digital sequences and of said auxiliary digital sequence, each of said pluralities of bits comprising a selected one bit and the remaining bits, a sequence of said selected one bits forming said first pseudo-random digital sequence, and (c) feedback means for receiving and feeding back said remaining bits as said auxiliary digital sequence to said summing means, whereby said first pseudo-random digital sequence is rendered more complex than said second and third pseudo-random digital sequences.
Claim 3
Dependent Claim 46 words
The generating apparatus as claimed in claim 1, wherein said feedback means comprises storage means for storing and delaying the application of said remaining bits to said summing means with respect to the receipt of said bits of at least said second and third digital sequences.
Claim 4
Dependent Claim 19 words
The generating apparatus as claimed in claim 1, wherein a secret key is used to initialize said generating means.
Claim 5
Dependent Claim 19 words
The generating apparatus as claimed in claim 2, wherein a secret key is used to initialize said storage means.
Claim 6
Dependent Claim 34 words
The generating apparatus as claimed in claim 1, wherein there is further included means for combining a plaintext digital data sequence and said first pseudo-random digital sequence to provide an encrypted digital data sequence.
Claim 7
Dependent Claim 58 words
The generating apparatus as claimed in claim 1, wherein said feedback means comprises a substitution block for converting said remaining bits of each of said pluralities of bits in a manner such that the integer formed by said converted remaining bits differs from the integer formed by said corresponding remaining bits that are inputted to said substitution block.
Claim 8
Dependent Claim 55 words
The generating apparatus as claimed in claim 1, wherein said feedback means comprises logic means for receiving as an input and converting said remaining bits of each of said pluralities of bits such that the integer formed by said converted, remaining bits is the same integer as that formed by said input of remaining bits.
Claim 9
Dependent Claim 56 words
The generating apparatus as claimed in claim 1, wherein said feedback means comprises logic means for receiving as an input said remaining bits of each of said pluralities of bits and for providing as an output a corresponding plurality of bits that form the integer equal to the sum of said input of said remaining bits.
Claim 10
Dependent Claim 36 words
The generating apparatus as claimed in claim 1, wherein said generating means comprises at least first and second feedback-connected shift registers whose output sequences are respectively at least said second and third periodic pseudo-random digital sequences.
Claim 11
Dependent Claim 26 words
The generating apparatus as claimed in claim 9, wherein the initial contents of said first and second feedback-connected shift registers are determined by a secret key.
Claim 12
Dependent Claim 92 words
The generating apparatus as claimed in claim 1, wherein said generating means comprises a first feedback-connected shift register having a plurality of stages, each of said stages having as an output a binary digital sequence, at least second and third feedback-connected shift registers for providing register output sequences, and means for combining said register output sequences of at least said second and third feedback-connected shift registers respectively with an output sequence from a different stage of said first feedback-connected shift register to provide thereby said second and third periodic, pseudo-random digital sequences.
Claim 13
Dependent Claim 34 words
The generating apparatus as claimed in claim 11 wherein the initial content of at least said second and third feedback-connected shift registers and said first feedback-connected shift register is determined by a secret key.
Claim 14
Dependent Claim 153 words
The generating apparatus as claimed in claim 1, wherein said summing means comprises first and second adder circuits, at least said second and third periodic, pseudo-random digital sequences being applied to said first adder circuit whose output is a first digital sum sequence of pluralities of bits, each of said pluralities of bits of said first digital sum sequence being the integer sum of the corresponding bits of at least said second and third pseudo-random sequences, said first digital sum sequence and said auxiliary digital sequence being applied as inputs to said second adder circuit whose output is a second digital sum sequence, said second digital sum sequence comprising a sequence of pluralities of bits, each of said pluralities of bits of said second digital sum sequence forming the integer sum of the corresponding integers formed by said pluralities of bits of said first digital sum sequence and said auxiliary digital sequence respectively.
Claim 15
Independent Claim 196 words
A method of generating a complex first pseudo-random digital sequence, said method comprising the steps of: (a) generating at least second and third periodic, pseudo-random digital sequences; (b) summing said second and third periodic, pseudo-random digital sequences and an auxiliary digital sequence to obtain a digital sum thereof, said digital sum comprising a sequence of pluralities of bits, each of said pluralities of bits of said digital sum being the integer sum of the corresponding bits of at least said second and third pseudo-random digital sequences and of said auxiliary digital sequence, each of said pluralities of bits of said digital sum comprising a selected one bit and the remaining bits; (c) forming said complex first pseudo-random digital sequence as a sequence of said selected one bits; and (d) forming said auxiliary digital sequence as a sequence of said remaining bits of each of said pluralities of bits of said digital sum and for feeding back said auxiliary digital sequence to be summed with at least said second and third periodic, pseudo-random digital sequences as in step b, whereby said first pseudo-random digital sequence is rendered more complex than said second and third pseudo-random digital sequences.
Claim 16
Independent Claim 196 words
A method of generating a complex first pseudo-random digital sequence, said method comprising the steps of: (a) generating at least second and third periodic, pseudo-random digital sequences; (b) summing said second and third periodic, pseudo-random digital sequences and an auxiliary digital sequence to obtain a digital sum thereof, said digital sum comprising a sequence of pluralities of bits, each of said pluralities of bits of said digital sum being the integer sum of the corresponding bits of at least said second and third pseudo-random digital sequences and of said auxiliary digital sequence, each of said pluralities of bits of said digital sum comprising a selected one bit and the remaining bits; (c) forming said complex first pseudo-random digital sequence as a sequence of said selected one bits; and (d) forming said auxiliary digital sequence as a sequence of said remaining bits of each of said pluralities of bits of said digital sum and for feeding back said auxiliary digital sequence to be summed with at least said second and third periodic, pseudo-random digital sequences as in step b, whereby said first pseudo-random digital sequence is rendered more complex than said second and third pseudo-random digital sequences.
Claim 17
Dependent Claim 41 words
The method of generating as claimed in claim 14, wherein there is further included the step of storing and delaying the application of said auxiliary digital sequence with respect to the receipt of said second and third periodic, pseudo-random digital sequences.
Claim 18
Dependent Claim 39 words
The method of generating as claimed in claim 14, wherein there is further included the step of initializing at least one initial bit of at least said second and third periodic, pseudo-random digital sequences according to a secret key.
Claim 19
Dependent Claim 36 words
The method of generating as claimed in claim 14, wherein there is further included the step of initializing the initial one of said pluralities of bits of said auxiliary digital sequence according to a secret key.
Claim 20
Dependent Claim 35 words
The method of generating as claimed in claim 14, wherein there is further included the step of combining a plaintext digital data sequence and first pseudo-random digital sequence to provide an encrypted digital data sequence.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-01-10 1992-07-11 1993-01-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-01-10 1996-07-11 1997-01-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-01-10 2000-07-11 2001-01-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag