US4878246A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for generating encryption/decryption key
Assignee: Pitney Bowes Inc
•
Filing: 1988-05-02
•
Granted: 1989-10-31
•
Expires: 2008-05-02
Abstract
Abstract An encryption/decryption key is generated from an identification number ID by first generating two sets of numbers from the identification number ID, based upon known expressions. The first set of numbers are employed as coefficients of a first polynomial to generate N first numbers for x=0, 1 . . . N-1 (N is the number of bits of the key) and a second number corresponding to each first number is generating employing the second set of numbers as coefficients and the generated first numbers as variables. The ordered pairs of first and second numbers generated correspond to addresses of a memory at which bits of the key are stored, the order of the bits being determined by the corresponding values of X. The expressions employ modular arithmetic using prime numbers as bases.
Inventors
- 👤 Jose Pastor
- 👤 Maya R. Barton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 23:24
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/08; H04L9/0861; H04L9/0866; H04L9/12
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
154 words
A method for generating a key code from an identification number ID, said key having N bits, comprising generating a first plurality of numbers, modulus A and a second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers with A greater than N-1; generating N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; generating a value z(y), mod B, from a second polynomial having said third, fourth and fifth numbers as coefficients and y as a variable, corresponding to each value of y(x) accessing a memory at addresses as determined as function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 2
Independent Claim
154 words
A method for generating a key code from an identification number ID, said key having N bits, comprising generating a first plurality of numbers, modulus A and a second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers with A greater than N-1; generating N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; generating a value z(y), mod B, from a second polynomial having said third, fourth and fifth numbers as coefficients and y as a variable, corresponding to each value of y(x) accessing a memory at addresses as determined as function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 3
Independent Claim
162 words
A device for generating a key code from an identification number ID, said key having N bits, comprising: means for generating a first plurality of numbers, modulus A and a second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers, with A greater than N-1; means for generating N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; means for generating a value z(y), mod B, from a second polynomial having said second plurality of numbers as coefficients and y as a variable, corresponding to each value of y(x), and; means for accessing a memory at addresses determined as a function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 4
Independent Claim
162 words
A device for generating a key code from an identification number ID, said key having N bits, comprising: means for generating a first plurality of numbers, modulus A and a second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers, with A greater than N-1; means for generating N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; means for generating a value z(y), mod B, from a second polynomial having said second plurality of numbers as coefficients and y as a variable, corresponding to each value of y(x), and; means for accessing a memory at addresses determined as a function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 5
Dependent Claim
187 words
Means for generating corresponding keys at first and second stations from an identification number ID, said key having N bits, comprising: means at each of said first and second stations for generating an identical first plurality of numbers, modulus A and an identical second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers, and A is greater than N-1; means at each station for generating identical N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; means at each station for generating an identical value z(y), mod B, from a second polynomial having said second plurality of numbers as coefficients and y as a variable, corresponding to each value of y(x); and, means at each station for accessing a memory at addresses determined as a function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 6
Dependent Claim
187 words
Means for generating corresponding keys at first and second stations from an identification number ID, said key having N bits, comprising: means at each of said first and second stations for generating an identical first plurality of numbers, modulus A and an identical second plurality of numbers, modulus B, from ID, in accordance with a set of algorithms, wherein A and B are prime numbers, and A is greater than N-1; means at each station for generating identical N values y(x), mod A, from a first polynomial having said first plurality of numbers as coefficients and x as a variable, wherein x is an integer from 0 to N-1; means at each station for generating an identical value z(y), mod B, from a second polynomial having said second plurality of numbers as coefficients and y as a variable, corresponding to each value of y(x); and, means at each station for accessing a memory at addresses determined as a function of y,z corresponding to each value of x to retrieve data therein, and reordering said data as a function of the value of x to produce said key.
Claim 7
Independent Claim
94 words
A method for generating a key code having N elements and corresponding to a number, ID, comprising the steps of: (a) generating a unique sequence of N memory addresses as a modular function of said number ID; and, (b) accessing memory cells in accordance with said sequence of memory addresses and retrieving code elements stored therein; (c) whereby the resulting sequence of code elements constitutes said key code; and wherein, (d) the number of said memory cells is substantially greater than N, and cells other than said accessed cells contain randomly selected code elements.
Claim 8
Independent Claim
94 words
A method for generating a key code having N elements and corresponding to a number, ID, comprising the steps of: (a) generating a unique sequence of N memory addresses as a modular function of said number ID; and, (b) accessing memory cells in accordance with said sequence of memory addresses and retrieving code elements stored therein; (c) whereby the resulting sequence of code elements constitutes said key code; and wherein, (d) the number of said memory cells is substantially greater than N, and cells other than said accessed cells contain randomly selected code elements.
Claim 9
Dependent Claim
96 words
The method of claim 4 wherein the number of said cells is M, comprisng the further steps of: (a) providing a second memory having M cells; (b) randomly storing the addresses of said cells in said first memory in said cells of said second memory; and; (c) wherein step (a) further comprises generating a unique sequence of N memory addresses for said cells of said second memory as a function of said number ID and retrieving the corresponding sequence of addresses for said cells of said first memory from said addressed cells of said second memory.
Claim 10
Dependent Claim
24 words
The method of claim 5 wherein M=A*B, and A and B are prime numbers, and A is the smallest prime number greater than N-1.
Claim 11
Dependent Claim
130 words
The method of claim 6 wherein said step of generating said sequence of addresses or said second memory comprises the further steps of: (a) generating a unique series of N column addresses y for A columns of said second memory as a function of said number ID and a variable x, where each value of x corresponds to one element of said key code; (b) generating a unique series of N row addresses for B rows of said second memory as a function of said number ID and y i and (c) for each element of said key code selecting said address for said cells in said first memory to be said address stored in the row and column of said second memory defined by said corresponding value of x.
Claim 12
Dependent Claim
25 words
The method of claim 6 wherein said number ID is, at least in part, defined by the identity of a user of said key code.
Claim 13
Dependent Claim
28 words
The method of claim 6 wherein said number ID is, at least in part, defined by a sequence number identified in a particular use of said key code.
Claim 14
Dependent Claim
25 words
The method of claim 4 wherein said number ID is, at least in part, defined by the identity of a user of said key code.
Claim 15
Dependent Claim
28 words
The method of claim 4 wherein said number ID is, at least in part, defined by a sequence number identified in a particular use of said key code.
Claim 16
Dependent Claim
96 words
Apparatus for generating key code having N elements and corresponding to a number, ID, comprising: (a) means for generating a unique sequence of N memory addresses as a modular function of said number ID, and; (b) means for accessing memory cells in a memory in accordance wih said sequence of memory addresses and retrieving code elements stored therein; (c) whereby the resulting sequence of code elements constitutes said key codes; and wherein, (d) the number of said memory cells is substantially greater than N, and cells other than said accessed cells contain randomly selected code elements.
Claim 17
Dependent Claim
96 words
Apparatus for generating key code having N elements and corresponding to a number, ID, comprising: (a) means for generating a unique sequence of N memory addresses as a modular function of said number ID, and; (b) means for accessing memory cells in a memory in accordance wih said sequence of memory addresses and retrieving code elements stored therein; (c) whereby the resulting sequence of code elements constitutes said key codes; and wherein, (d) the number of said memory cells is substantially greater than N, and cells other than said accessed cells contain randomly selected code elements.
Claim 18
Dependent Claim
96 words
The apparatus of claim 12 wherein the number of said cells is M, comprising: (a) a second memory having M cells; (b) said second memory randomly storing the addresses of said cells in said first memory in cells of said second memory, and; (c) wherein said generating means further comprises means for generating a unique sequence of N memory addresses for said cells of said second memory as a function of said number 10 and retrieving the corresponding sequence of addresses for said cells of said first memory from said addresses cells of said second memory.
Claim 19
Dependent Claim
24 words
The apparatus of claim 13 wherein M=A*B, and A and B are prime numbers, and A is the smallest prime number greater than N-1.
Claim 20
Dependent Claim
125 words
The apparatus of claim 14 wherein said further generating means still further comprises: (a) means for generating a unique series of N column address y for A columns of said second memory as a function of said number ID and a variable x, where each value of x corresponds to one element of said key code; (b) means for generating a unique series of N row addresses for B rows of said second memory as a function of said number ID and y i and (c) means for each element of said key code, selecting said address for said cells in said first memory to be said address stored in the row and column of said second memory defined by said corresponding value of x.
Claim 21
Dependent Claim
25 words
The apparatus of claim 14 wherein said number ID is, at least in part, defined by the identity of a user of said key code.
Claim 22
Dependent Claim
28 words
The apparatus of claim 14 wherein said number ID is, at least in part, defined by a sequence number identify in a particlar use of said key code.
Claim 23
Dependent Claim
25 words
The apparatus of claim 12 wherein said number ID is, at least in part, defined by the identity of a user of said key code.
Claim 24
Dependent Claim
28 words
The apparatus of claim 12 wherein said number ID is, at least in part, defined by a sequence number identify in a particular use of said key code.
References Cited (Backward Citations)
US4358852A
Cited
US4274085A
Cited
US4447672A
Cited
US4613901A
Cited
US4780905A
Cited
US4803725A
Cited
US4771462A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-10-30 | 1993-05-01 | 1993-10-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-10-30 | 1997-05-01 | 1997-10-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-10-30 | 2001-05-01 | 2001-10-31 | $7700.00 | Window Closed / Lapsed |