Patent US5438622A successfully refreshed from Google Patents.
US5438622A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for improving the security of an electronic codebook encryption scheme utilizing an offset in the pseudorandom sequence
Assignee: Apple Inc
•
Filing: 1994-01-21
•
Granted: 1995-08-01
•
Expires: 2014-01-21
Abstract
Abstract A method and apparatus for improving the security of an electronic codebook encryption scheme comprises a transmitter unit for encoding or encrypting data and a separate authorized receiver for decoding or decrypting the data. During the encryption of the plaintext data, a randomly generated offset is introduced into the PN sequence to vary the starting point of the PN sequence as it is applied to the plaintext data. The offset is encrypted with the secret key and the unencrypted IV, encrypted offset, and ciphertext are exported by the transmitter to the receiver for decrypting. The encoded communication is imported by the receiver and the encrypted offset portion is extracted. The receiver combines the encrypted offset with the secret key to decipher the offset value. The offset and PN sequence are then combined with the ciphertext, using an XOR gate, to recover the original plain text from the ciphertext. In an alternative embodiment, the encoding PN sequence is composed of multiple, non-contiguous random sequence segments comprising a two-dimensional array. An incremental IV ID is generated for each IV issued in the creation of a segment. Each random sequence segment is identifiable by its IV ID. The starting point at which the random sequence segments are applied to a string of plaintext data is deferred from the beginning of the first random sequence segment in accordance with a composite offset.
Inventors
- 👤 James O. Normile
- 👤 Ke-Chiang Chu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 14:54
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L9/12; H04L2209/00; H04L2209/12; H04L2209/34
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
102 words
An apparatus for the communication of encrypted data, the apparatus comprising a transmitter which further comprises: a first Pseudorandom Number (PN) generator for generating a first sequence of pseudorandom numbers; an offset generator which operates to select a subset of the first sequence of pseudorandom numbers; and an encoder comprising a first input for receiving the subset of the first sequence of pseudorandom numbers and a second input for receiving an original sequence of plaintext data, in which the encoder combines the subset of the first sequence of pseudorandom numbers and the sequence of plaintext data to produce an encrypted data output.
Claim 2
Independent Claim
102 words
An apparatus for the communication of encrypted data, the apparatus comprising a transmitter which further comprises: a first Pseudorandom Number (PN) generator for generating a first sequence of pseudorandom numbers; an offset generator which operates to select a subset of the first sequence of pseudorandom numbers; and an encoder comprising a first input for receiving the subset of the first sequence of pseudorandom numbers and a second input for receiving an original sequence of plaintext data, in which the encoder combines the subset of the first sequence of pseudorandom numbers and the sequence of plaintext data to produce an encrypted data output.
Claim 3
Dependent Claim
81 words
The apparatus according to claim 1 further comprising a receiver, the receiver comprising: a second PN generator for generating a second sequence of pseudorandom numbers; and a decoder comprising a first input for receiving the second sequence of pseudorandom numbers and a second input for receiving the output of the transmitter containing the encrypted data, in which the decoder combines the second sequence of pseudorandom numbers and the encrypted data to produce the original sequence of plaintext data as an output.
Claim 4
Dependent Claim
36 words
The apparatus according to claim 2 wherein the first input of the decoder receives a subset of the second sequences of pseudorandom numbers which is identical to the subset of the first sequence of pseudorandom numbers.
Claim 5
Dependent Claim
34 words
The apparatus according to claim 1, wherein the first PN generator and the second PN generator are both initialized using a secret key which is commonly utilized by both the transmitter and the receiver.
Claim 6
Dependent Claim
34 words
The apparatus according to claim 4, wherein the first PN generator and the second PN generator are both further initialized using an initialization vector which is commonly utilized by both the transmitter and receiver.
Claim 7
Dependent Claim
29 words
The apparatus according to claim 5, wherein the first PN generator and the second PN generator are both initialized by logically combining the secret key and the initialization vector.
Claim 8
Dependent Claim
22 words
The apparatus according to claim 5, further comprising an initialization vector generator coupled to the PN generator for selectively generating initialization vectors.
Claim 9
Dependent Claim
36 words
The apparatus according to claim 5, wherein the encrypted data is transferred from the transmitter to the receiver in a data stream, the data stream comprising the initialization vector, the encrypted offset and the encrypted data.
Claim 10
Dependent Claim
43 words
The apparatus according to claim 1, wherein the offset generator selects a subset of the sequence of pseudorandom numbers for combining with the plaintext data sequence by initiating the combining of sequences at a deferred starting point along the sequence of pseudorandom numbers.
Claim 11
Dependent Claim
15 words
The apparatus according to claim 1, wherein the first sequence of pseudorandom numbers is contiguous.
Claim 12
Dependent Claim
23 words
The apparatus according to claim 1, wherein the first sequence of pseudorandom numbers is comprised of multiple, non-contiguous segments forming a multi-dimensional array.
Claim 13
Dependent Claim
61 words
The apparatus according to claim 11, wherein: the first PN generator is initialized using an initialization vector; a new initialization vector is generated from an initialization vector generator for each PN sequence segment; an initialization vector identifier is generated for each initialization vector generated; and the PN sequence segments are indexed by initialization vectors concatenated with their respective initialization vector identifiers.
Claim 14
Dependent Claim
31 words
The apparatus according to claim 12, wherein the offset is a composite of at least two values which, when applied to the multidimensional array, defers the starting point of the array.
Claim 15
Dependent Claim
20 words
The apparatus according to claim 1, wherein the transmitter and receiver are implemented using at least one general purpose computer.
Claim 16
Dependent Claim
77 words
An encryption system comprising: transmitter means for encrypting plaintext data into ciphertext, the transmitter means further comprising: first pseudorandom number generating means for generating a first pseudorandom number sequence; offset generating means for generating a random offset; and encoding means for combining the first pseudorandom number sequence with the offset and plaintext data to produce the ciphertext; and receiver means for receiving the ciphertext from the transmitter means and decrypting the ciphertext to the original plaintext data.
Claim 17
Dependent Claim
77 words
An encryption system comprising: transmitter means for encrypting plaintext data into ciphertext, the transmitter means further comprising: first pseudorandom number generating means for generating a first pseudorandom number sequence; offset generating means for generating a random offset; and encoding means for combining the first pseudorandom number sequence with the offset and plaintext data to produce the ciphertext; and receiver means for receiving the ciphertext from the transmitter means and decrypting the ciphertext to the original plaintext data.
Claim 18
Dependent Claim
35 words
The encryption system according to claim 15, the receiver means further comprising second pseudorandom number generating means for generating a second pseudorandom number sequence identical to the first pseudorandom number sequence generated in the transmitter.
Claim 19
Dependent Claim
38 words
The encryption system according to claim 16, the receiver means further comprising decoding means for combining the ciphertext with the second pseudorandom number sequence and the random offset of the transmitter means to produce the original plaintext data.
Claim 20
Independent Claim
69 words
A method for encrypting a sequence of plaintext data comprising the steps: generating a first pseudorandom number sequence; generating a random offset; encrypting the plaintext data to produce ciphertext by logically combining the plaintext data with the first pseudorandom number sequence, deferring the starting point of the first pseudorandom number sequence in accordance with the offset; and exporting the ciphertext in combination with the initialization vector and the offset.
Claim 21
Independent Claim
69 words
A method for encrypting a sequence of plaintext data comprising the steps: generating a first pseudorandom number sequence; generating a random offset; encrypting the plaintext data to produce ciphertext by logically combining the plaintext data with the first pseudorandom number sequence, deferring the starting point of the first pseudorandom number sequence in accordance with the offset; and exporting the ciphertext in combination with the initialization vector and the offset.
Claim 22
Dependent Claim
78 words
The method according to claim 18 further including decrypting of the ciphertext in a receiver, the decrypting comprising the steps: importing the ciphertext combination; separating the ciphertext from the initialization vector and the offset in the ciphertext combination; generating a second pseudorandom number sequence identical to the first pseudorandom number sequence utilizing the imported initialization vector and the secret key; and decrypting the imported ciphertext by combining the ciphertext with the offset and the second pseudorandom number sequence.
Claim 23
Dependent Claim
47 words
The method according to claim 18 wherein the step of generating a first pseudorandom number sequence includes the step of generating the sequence from an initialization vector and a secret key, where the length of the pseudorandom number sequence exceeds the length of the plaintext data sequence.
Claim 24
Dependent Claim
38 words
The method according to claim 18, wherein the step of generating a first pseudorandom number sequence further comprises the step of storing the generated first pseudorandom number sequence and its corresponding initialization vector for future use in decrypting.
Claim 25
Dependent Claim
30 words
The method according to claim 18 wherein the method of encrypting a sequence of plaintext data further comprises the step of encrypting the offset with the first pseudorandom number sequence.
Claim 26
Dependent Claim
26 words
The method according to claim 22 wherein the step of exporting the ciphertext further includes combining the ciphertext with the initialization vector and the encrypted offset.
Claim 27
Dependent Claim
30 words
The method according to claim 19 wherein the step of separating the ciphertext further includes separating the ciphertext from the initialization vector and an encrypted offset in the ciphertext combination.
Claim 28
Dependent Claim
41 words
The method according to claim 19, wherein the step of generating a second pseudorandom number from the imported initialization vector further comprises the step of storing the generated second pseudorandom number and its corresponding initialization vector for future use in decrypting.
Claim 29
Dependent Claim
28 words
The method according to claim 19 wherein the method of decrypting further includes the step of decrypting the offset by combining the offset with the second pseudorandom sequence.
Claim 30
Dependent Claim
32 words
The method according to claim 26 wherein the step of decrypting the imported ciphertext further includes the step of combining the ciphertext with a decrypted offset and the second pseudorandom number sequence.
Claim 31
Dependent Claim
30 words
The method according to claim 18 wherein the step of generating a first pseudorandom number sequence further includes the step of generating a plurality of non-contiguous pseudorandom number sequence segments.
Claim 32
Dependent Claim
23 words
The method according to claim 28 further including the step of forming a multi-dimensional array from the plurality of pseudorandom number sequence segments.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-07-31 | 1999-01-30 | 1999-08-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-07-31 | 2003-01-30 | 2003-08-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-07-31 | 2007-01-30 | 2007-08-01 | $7700.00 | Window Closed / Lapsed |