Patent US5014313A successfully refreshed from Google Patents.
US5014313A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Text modifier
Assignee: Motorola Solutions Inc
•
Filing: 1989-07-07
•
Granted: 1991-05-07
•
Expires: 2009-07-07
Abstract
Abstract A method is disclosed and apparatus is described whereby plain text is modified before it is input to a binary key generator (encryptor). According to the invention, a plain text bit may be modified by a current modifying bit, which in turn, is based on a prior modifying bit, a prior plain text bit, and a prior ciphered text bit. The only data path provided to the transmitter is the encrypted key generator cipher text output. As a result, the only feed-foward path of the plain text to the channel is through the key generator, and thus the fault-immune physical barrier between the plain text and the cipher information inherent with the key generator is maintained. The invention provides a way of utilizing conventional binary key generators to digitally encrypt for radio transmission multilevel sub-band coded speech.
Inventors
- 👤 Michael D. Kotzin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 12:40
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L2209/00; H04L2209/04; H04L2209/046; H04L2209/12
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
232 words
A method for processing a plain text ("PT") bit stream for a binary encryption device having an input and an output so that an input bit stream applied to the input causes an output bit stream of ciphered text ("CT") to appear at the output, said plain text ("PT") bit stream comprising PT words, each PT word having n bits of increasing order, each bit designated PT i , where i varies from 1 to n, each word having a first bit (PT 1 ) that is least significant and a last bit (PT n ) that is most significant, comprising the steps of: forming a modified plain text ("MPT") bit stream and applying said MPT bit stream to said input of said binary encryption device, said MPT bit stream formed by the following method: for the current PT bit (PT i ), computing a current MPT bit (MPT i ) based at least in part on said PT i EXCLUSIVE OR a current modifier bit ("M i "), said M i , where i is not equal to 1, based on: the quantity PT i-1 AND the inverse of the quantity CT i-1 EXCLUSIVE OR M i-1 , OR the quantity PT i-1 AND M i-1 , OR the quantity M i-1 AND the inverse of the quantity PT i-1 EXCLUSIVE OR CT i-1 , wherein M 1 =logic zero (0).
Claim 2
Independent Claim
232 words
A method for processing a plain text ("PT") bit stream for a binary encryption device having an input and an output so that an input bit stream applied to the input causes an output bit stream of ciphered text ("CT") to appear at the output, said plain text ("PT") bit stream comprising PT words, each PT word having n bits of increasing order, each bit designated PT i , where i varies from 1 to n, each word having a first bit (PT 1 ) that is least significant and a last bit (PT n ) that is most significant, comprising the steps of: forming a modified plain text ("MPT") bit stream and applying said MPT bit stream to said input of said binary encryption device, said MPT bit stream formed by the following method: for the current PT bit (PT i ), computing a current MPT bit (MPT i ) based at least in part on said PT i EXCLUSIVE OR a current modifier bit ("M i "), said M i , where i is not equal to 1, based on: the quantity PT i-1 AND the inverse of the quantity CT i-1 EXCLUSIVE OR M i-1 , OR the quantity PT i-1 AND M i-1 , OR the quantity M i-1 AND the inverse of the quantity PT i-1 EXCLUSIVE OR CT i-1 , wherein M 1 =logic zero (0).
Claim 3
Dependent Claim
15 words
The method of claim 1 wherein each PT word comprises a multilevel sub-band coded sample.
Claim 4
Independent Claim
173 words
A method for forming a "z" bit stream having bits designated z i , based on an "x" bit stream having bits designated x i , where i=1, 2, 3, . . . each x i of successively increasing order, the least significant bit x 1 coming first and based on a "y" bit stream having bits designated y i , comprising the steps of: (1) setting z 1 =x 1 , and (2) for i not equal to 1: (a) providing a modifying bit m i , based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 5
Independent Claim
173 words
A method for forming a "z" bit stream having bits designated z i , based on an "x" bit stream having bits designated x i , where i=1, 2, 3, . . . each x i of successively increasing order, the least significant bit x 1 coming first and based on a "y" bit stream having bits designated y i , comprising the steps of: (1) setting z 1 =x 1 , and (2) for i not equal to 1: (a) providing a modifying bit m i , based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 6
Independent Claim
189 words
A method for forming a modified text "z" bit stream input to a binary encryption device having bits designated z i , based on a plain text "x" bit stream having bits designated x i , where i=1, 2, 3, . . . each x i of successively increasing order, the least significant x 1 coming first, and based on a ciphered text "y" bit stream output from said binary encryption device having bits designated y i , comprising the steps of: (1) setting z 1 =x 1 , and (2) for i not equal to 1; (a) providing a modifying bit m i based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 7
Independent Claim
189 words
A method for forming a modified text "z" bit stream input to a binary encryption device having bits designated z i , based on a plain text "x" bit stream having bits designated x i , where i=1, 2, 3, . . . each x i of successively increasing order, the least significant x 1 coming first, and based on a ciphered text "y" bit stream output from said binary encryption device having bits designated y i , comprising the steps of: (1) setting z 1 =x 1 , and (2) for i not equal to 1; (a) providing a modifying bit m i based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 8
Independent Claim
256 words
A method for forming a "z" bit stream comprising words each having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit of each word being z 1 , the most significant bit of each word being z n , based on an "x" bit stream comprising words each having n bits, each bit designated x i , the least significant bit of each word being x i , the most significant bit of each word being x n , and based on a "y" bit stream comprising words each having n bits, each bit designated y i , the least significant bit of each word being y 1 , the most significant bit of each word being y n , comprising the steps of: (1) for each x word and the y word corresponding thereto, forming a z word with z 1 =x 1 , and (2) for i not equal to 1: (a) providing a modifying bit m i based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 9
Independent Claim
256 words
A method for forming a "z" bit stream comprising words each having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit of each word being z 1 , the most significant bit of each word being z n , based on an "x" bit stream comprising words each having n bits, each bit designated x i , the least significant bit of each word being x i , the most significant bit of each word being x n , and based on a "y" bit stream comprising words each having n bits, each bit designated y i , the least significant bit of each word being y 1 , the most significant bit of each word being y n , comprising the steps of: (1) for each x word and the y word corresponding thereto, forming a z word with z 1 =x 1 , and (2) for i not equal to 1: (a) providing a modifying bit m i based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 10
Independent Claim
213 words
A method for providing a third word having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit thereof being z 1 , the most significant bit thereof being z n , based on a first word having n bits each designated x i , the least significant bit being x 1 , the most significant bit being x n , and based on a second word having n bits, each bit designated y i , the least significant bit thereof being y 1 , the most significant bit thereof being y n , comprising the steps of: (1) setting z 1 =x 1 and , (2) for other z i : (a) providing a modifying bit mi based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 11
Independent Claim
213 words
A method for providing a third word having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit thereof being z 1 , the most significant bit thereof being z n , based on a first word having n bits each designated x i , the least significant bit being x 1 , the most significant bit being x n , and based on a second word having n bits, each bit designated y i , the least significant bit thereof being y 1 , the most significant bit thereof being y n , comprising the steps of: (1) setting z 1 =x 1 and , (2) for other z i : (a) providing a modifying bit mi based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , where m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 12
Independent Claim
255 words
A method for providing a modified plain text word for a binary encryption device arranged for receiving an input bit stream and for generating a ciphered output bit stream based on said input bit stream, said modified plain text word having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit thereof being z 1 the most significant bit thereof being z n , based on a plain text word having n bits each designated x i , the least significant bit thereof being x 1 , the most significant bit thereof being x n , and based on the corresponding ciphered text word output from said binary encryption device, having n bits, each bit designated y i , the least significant bit thereof being y 1 , the most significant bit thereof being y n comprising the steps of: (1) setting z 1 =x 1 , and (2) for other z i : (a) providing a modifying bit mi based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , wherein m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 13
Independent Claim
255 words
A method for providing a modified plain text word for a binary encryption device arranged for receiving an input bit stream and for generating a ciphered output bit stream based on said input bit stream, said modified plain text word having n bits, each bit designated z i , where i=1, 2, 3, . . . n, the least significant bit thereof being z 1 the most significant bit thereof being z n , based on a plain text word having n bits each designated x i , the least significant bit thereof being x 1 , the most significant bit thereof being x n , and based on the corresponding ciphered text word output from said binary encryption device, having n bits, each bit designated y i , the least significant bit thereof being y 1 , the most significant bit thereof being y n comprising the steps of: (1) setting z 1 =x 1 , and (2) for other z i : (a) providing a modifying bit mi based on x i-1 , y i-1 , and the modifying bit m i-1 , (b) providing z i based on x i and m i , wherein m 1 =logic zero (0), wherein said providing step (2) (a) includes computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 14
Dependent Claim
224 words
A text modifier for processing a plain text ("PT") bit stream comprising PT words for a binary encryption device having an input and an output so that an input bit stream applied to the input causes an output bit stream of ciphered text ("CT") to appear at the output, each PT word having n bits of increasing order, each bit designated PT i , where i varies from 1 to n, each word having a first bit (PT 1 ) that is least significant and a last bit (PT n ) that is most significant, said modifier comprising: means for forming a modified plain text ("MPT") bit stream including means for providing, for the current PT bit (PT i ), a current MPT bit (MPT i ) based at least in part on said PT i EXCLUSIVE OR a current modifier bit ("M i "), said M i , where i is not equal to 1, based on: the quantity PT i-1 AND the inverse of the quantity CT i-1 EXCLUSIVE OR M i-1 , OR the quantity PT i-1 AND M i-1 , OR the quantity M i-1 AND the inverse of the quantity PT i-1 EXCLUSIVE OR CT i-1 , wherein M 1 =logic zero (0), and means for applying said MPT bit stream to said input of said binary encryption device.
Claim 15
Dependent Claim
224 words
A text modifier for processing a plain text ("PT") bit stream comprising PT words for a binary encryption device having an input and an output so that an input bit stream applied to the input causes an output bit stream of ciphered text ("CT") to appear at the output, each PT word having n bits of increasing order, each bit designated PT i , where i varies from 1 to n, each word having a first bit (PT 1 ) that is least significant and a last bit (PT n ) that is most significant, said modifier comprising: means for forming a modified plain text ("MPT") bit stream including means for providing, for the current PT bit (PT i ), a current MPT bit (MPT i ) based at least in part on said PT i EXCLUSIVE OR a current modifier bit ("M i "), said M i , where i is not equal to 1, based on: the quantity PT i-1 AND the inverse of the quantity CT i-1 EXCLUSIVE OR M i-1 , OR the quantity PT i-1 AND M i-1 , OR the quantity M i-1 AND the inverse of the quantity PT i-1 EXCLUSIVE OR CT i-1 , wherein M 1 =logic zero (0), and means for applying said MPT bit stream to said input of said binary encryption device.
Claim 16
Dependent Claim
177 words
A text modifier including means for forming a "z" bit stream having bits designated z i , based on an "x" bit stream having bits designated x i , each x i of successively increasing order, the least significant bit x 1 coming first, and based on a "y" stream having bits designated y i , comprising: means for setting z 1 =x 1 , and, responsive to i not equal to 1, first means for providing a modifying bit m i , based on x i-1 , y i-1 and the modifying bit m i-1 , and, responsive to i not equal to 1, second means for providing z i based on x i and m i , where m 1 =logic zero (0), wherein said first providing means includes for computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
Claim 17
Dependent Claim
177 words
A text modifier including means for forming a "z" bit stream having bits designated z i , based on an "x" bit stream having bits designated x i , each x i of successively increasing order, the least significant bit x 1 coming first, and based on a "y" stream having bits designated y i , comprising: means for setting z 1 =x 1 , and, responsive to i not equal to 1, first means for providing a modifying bit m i , based on x i-1 , y i-1 and the modifying bit m i-1 , and, responsive to i not equal to 1, second means for providing z i based on x i and m i , where m 1 =logic zero (0), wherein said first providing means includes for computing: the quantity x i-1 AND the inverse of the quantity y i-1 EXCLUSIVE OR m i-1 , OR the quantity x i-1 AND m i-1 , OR the quantity m i-1 AND the inverse of the quantity x i-1 EXCLUSIVE OR y i-1 .
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-05-06 | 1994-11-05 | 1995-05-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-05-06 | 1998-11-05 | 1999-05-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-05-06 | 2002-11-05 | 2003-05-07 | $7700.00 | Window Closed / Lapsed |