US5619576A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Variable-key cryptography system
Assignee: Individual
•
Filing: 1995-04-03
•
Granted: 1997-04-08
•
Expires: 2015-04-03
Abstract
Abstract Binary data is encrypted or decrypted using a final key. The final key is formed by manipulating one or more user keys, a base key and a block of data, and combining the manipulated keys and data using an exclusive-OR operation. The data to be encrypted or decrypted are combined with the final key using a circular exclusive-OR operation. A new final key is formed for each block of data. The user and base keys are binary sequences having any number of bits. The user key may be input to the present invention directly in binary form or in any other suitable form that the present invention can interpret as a binary sequence, such as a string of ASCII-encoded alphanumeric characters. Manipulating the user key includes the steps of shuffling or permuting segments of the user key, such as bytes, circularly shifting the permuted user key by a number of bit positions, and filling a location with one or more copies of the permuted and shifted key such that the result has a length equal to that of the base key. The ordering of the segments of the user key in the permutation step and the number of bit positions by which the user key is shifted in the shifting step are determined in response to the value and position of the segments of the user key itself. Manipulating the base key includes the step of circularly shifting the base key by a number of bit positions that is determined in response to the value and position of segments of the user key.
Inventors
- 👤 William Y. Shaw
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 05:52
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L2209/00; H04L2209/12; H04L2209/34
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
79 words
A method for encrypting and decrypting input digital data, comprising the steps of: providing a first key comprising a sequence of bits; selecting a plurality of invariant bit positions in response to said first key; and providing output digital data having in each of said invariant bit positions a bit equal in value to said bit in a corresponding position in said input digital data and having in all other positions bits determined in response to said first key.
Claim 2
Independent Claim
79 words
A method for encrypting and decrypting input digital data, comprising the steps of: providing a first key comprising a sequence of bits; selecting a plurality of invariant bit positions in response to said first key; and providing output digital data having in each of said invariant bit positions a bit equal in value to said bit in a corresponding position in said input digital data and having in all other positions bits determined in response to said first key.
Claim 3
Dependent Claim
56 words
The method recited in claim 1, further comprising the step of forming an invariant key in response to said input digital data, said invariant key consisting of bits in said invariant bit positions in said input digital data, wherein said output digital data is provided in response to both said user key and said invariant key.
Claim 4
Dependent Claim
29 words
The method recited in claim 2, wherein said step of providing output digital data comprises the step of calculating the exclusive-OR of said first key and said invariant key.
Claim 5
Dependent Claim
30 words
The method recited in claim 1, wherein said step of providing output digital data comprises the step of calculating the exclusive-OR of said input digital data and a final key.
Claim 6
Dependent Claim
22 words
The method recited in claim 1, wherein said step of providing a first key comprises the step of permuting a user key.
Claim 7
Dependent Claim
22 words
The method recited in claim 1, wherein said step of providing a first key comprises the step of shifting a user key.
Claim 8
Independent Claim
129 words
A method for encrypting and decrypting digital data, comprising the steps of: forming an actual user key in response to at least one input user key comprising a sequence of bits; forming an actual base key comprising a sequence of bits; forming a semifinal key in response to said actual user key and said actual base key; determining invariant bit positions in response to said semifinal key; forming an invariant key in response to said invariant bit positions and a block of said digital data, said invariant key consisting of bits in said invariant bit positions in said block of said digital data; forming a final key in response to said semifinal key and said invariant key; and calculating the exclusive-OR of said final key and said digital data.
Claim 9
Independent Claim
129 words
A method for encrypting and decrypting digital data, comprising the steps of: forming an actual user key in response to at least one input user key comprising a sequence of bits; forming an actual base key comprising a sequence of bits; forming a semifinal key in response to said actual user key and said actual base key; determining invariant bit positions in response to said semifinal key; forming an invariant key in response to said invariant bit positions and a block of said digital data, said invariant key consisting of bits in said invariant bit positions in said block of said digital data; forming a final key in response to said semifinal key and said invariant key; and calculating the exclusive-OR of said final key and said digital data.
Claim 10
Dependent Claim
68 words
The method recited in claim 7, wherein said step of forming an actual user key comprises the steps of: permuting said input user key to form a permuted user key; circularly shifting said permuted user key to form a shifted user key; and filling a location having a length equal to the length of said base key with said shifted user key to form said actual user key.
Claim 11
Dependent Claim
42 words
The method recited in claim 7, wherein said step of forming an actual base key comprises the steps of: circularly shifting a predetermined base key comprising a sequence of bits; and permuting said base key in response to said actual user key.
Claim 12
Dependent Claim
29 words
The method recited in claim 7, wherein said step of forming a final key comprises the step of calculating the exclusive-OR of said semifinal key and said invariant key.
Claim 13
Dependent Claim
77 words
The method recited in claim 8, wherein said step of permuting said input user key comprises the steps of: selecting two selected portions of said input user key, each said selected portion comprising a sequence of bits, each said selected portion determined in response to the value and position within said input user key of each of a plurality of predetermined portions of said input user key; and swapping said selected portions of said input user key.
Claim 14
Dependent Claim
14 words
The method recited in claim 11, wherein each said portion consists of a byte.
Claim 15
Dependent Claim
22 words
The method recited in claim 12, wherein said predetermined portions consist of a plurality of consecutive bytes of said input user key.
Claim 16
Dependent Claim
20 words
The method recited in claim 13, wherein said predetermined portions consist of three consecutive bytes of said input user key.
Claim 17
Dependent Claim
117 words
The method recited in claim 14, wherein: said step of selecting two selected portions of said input user key comprises the steps of: selecting a byte KEY i of said input user key having an index number equal to i; selecting a byte KEY l of said input user key having an index number equal to L; and said step of permuting said input user key comprises repeating said steps of selecting a byte for values of i between 2 and N-1 inclusive, wherein each byte of said input user key has an index number, wherein N is the length of said input user key in bytes, and wherein: L=((KEY i-1 +KEY i +KEY i+1 +i)modulo N)+1.
Claim 18
Dependent Claim
63 words
The method recited in claim 8, wherein said step of circularly shifting said permuted user key comprises the step of: circularly shifting said permuted user key by a number of bit positions, said number determined in response to the value and positional weight of each of a plurality of portions of said permuted user key, each said portion comprising a sequence of bits.
Claim 19
Dependent Claim
101 words
The method recited in claim 16, wherein said step of circularly shifting said permuted user key by a number of bit positions comprises the steps of: forming a shift factor S equal to the sum of the values (255+i)*KEY i for values of i between 1 and N inclusive, wherein KEY is a byte of said user key, wherein each said byte of said user key has an index number, wherein N is the length of said user key in bytes; and circularly shifting said permuted user key by L bit positions toward the most significant bit position, wherein: L=(S modulo(N*8))+1.
Claim 20
Dependent Claim
135 words
The method recited in claim 7, wherein: said step of forming an actual user key comprises the steps of: permuting said input user key to form a permuted user key; circularly shifting said permuted user key to form a shifted user key; and filling a location having a length equal to the length of said base key with said shifted user key to form said actual user key; said step of forming an actual base key comprises the steps of: circularly shifting a predetermined base key by a number of bit positions determined in response to the value and positional weight of each of a plurality of portions of said permuted user key, each said portion comprising a sequence of bits; and permuting said circularly shifted base key in response to said actual user key.
Claim 21
Dependent Claim
113 words
The method recited in claim 18, wherein said step of circularly shifting said predetermined base key by a number of bit positions comprises the steps of: forming a shift factor S equal to the sum of the values (255+i)*KEY i for values of i between 1 and N inclusive, wherein KEY is a byte of said user key, wherein each said byte of said user key has an index number, wherein N is the length of said user key in bytes; and circularly shifting said predetermined base key by L bit positions toward the most significant bit position; wherein M is the length of said base key in bytes, and wherein: L=(S modulo(M*8))+1.
Claim 22
Dependent Claim
32 words
The method recited in claim 7, wherein said step of determining invariant bit positions in response to said semifinal key comprises the step of generating byte position indices and bit position indices.
Claim 23
Dependent Claim
30 words
The method recited in claim 20, wherein said step of determining invariant bit positions in response to said semifinal key further comprises the step of forming an invariant bit mask.
Claim 24
Dependent Claim
55 words
The method recited in claim 7, wherein said step of forming an invariant key comprises the steps of: selecting bits of said digital data in said invariant bit positions in a block of said digital data having a length equal to the length of said semifinal key; and copying and appending together the selected bits.
Claim 25
Dependent Claim
33 words
The method recited in claim 22, wherein said step of determining invariant bit positions in response to said semifinal key comprises the step of forming an invariant bit mask, said invariant bit mask.
Claim 26
Dependent Claim
24 words
The method recited in claim 23 wherein said step of forming an invariant key further comprises the step of circularly filling said invariant bits.
Claim 27
Dependent Claim
50 words
The method recited in claim 24, wherein said step of forming a final key comprises the steps of: forming the exclusive-OR of said semifinal key and said invariant key; and forming the logical AND of said invariant bit mask and said exclusive-OR of said semifinal key and said invariant key.
References Cited (Backward Citations)
US4225935A
Cited
US4200770A
Cited
US4369332A
Cited
US4503287A
Cited
US4663500A
Cited
WO1984000456A1
Cited
US4819267A
Cited
US4596898A
Cited
US4897876A
Cited
WO1990014735A1
Cited
EP0410516A1
Cited
US5231662A
Cited
WO1992002089A1
Cited
US5115467A
Cited
US5237612A
Cited
US5241599A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-07 | 2000-10-07 | 2001-04-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-07 | 2004-10-07 | 2005-04-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-07 | 2008-10-07 | 2009-04-08 | $7700.00 | Window Closed / Lapsed |