US4417338A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cryptographic key sharing circuit and method using code correction
Assignee: Wisconsin Alumni Research Foundation
•
Filing: 1981-04-13
•
Granted: 1983-11-22
•
Expires: 2001-04-13
Abstract
Abstract A circuit and method for sharing a key among n individuals by distributing a secondary key to each of the n individuals such that only k of the n secondary keys are required in order to reconstruct the key, where k may be less than n. The key is encoded into a code vector which is corrupted by combining it with an error vector to yield a corrupted code vector. The secondary keys are chosen so that each one is a mutually exclusive part of the error vector. Reconstructing the key, which is the objective of the process and is analagous to opening a lock, requires correcting the corrupted code vector and transforming the code vector into the key. The corrupted code vector is corrected by a combination of an error correcting code and use of at least k of the secondary keys. Each secondary key can be used to correct the errors introduced in the part of the error vector that it comprises, and if less than k secondary keys are present, then even after the secondary keys have been used to correct the corresponding errors there are too many errors remaining for the error correcting code to correct, resulting in a failure to reconstruct the code vector or key.
Inventors
- 👤 George I. Davida
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 07:12
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/30; H04L9/304; H04L2209/00; H04L2209/08; H04L2209/12; H04L2209/125
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
98 words
A method for generating a certain number of secondary keys and for using some of said secondary keys in cooperation with a corrupted code vector to reconstruct a code vector having a length of N digits, comprising the steps of: choosing a certain number, n, of secondary keys to be distributed to n individuals; assigning a subset of digit positions comprising e of said N digit positions of said code vector to each of said secondary keys in a random manner such that the total number of such digit positions assigned is equal to a certain number T=n×e;
Claim 2
Independent Claim
98 words
A method for generating a certain number of secondary keys and for using some of said secondary keys in cooperation with a corrupted code vector to reconstruct a code vector having a length of N digits, comprising the steps of: choosing a certain number, n, of secondary keys to be distributed to n individuals; assigning a subset of digit positions comprising e of said N digit positions of said code vector to each of said secondary keys in a random manner such that the total number of such digit positions assigned is equal to a certain number T=n×e;
Claim 3
Dependent Claim
132 words
calculating a corrupted code vector by creating errors in each of said T digit positions of said code vector assigned to said secondary keys and in e' randomly chosen digit positions; choosing an error correcting code system comprising a set of code vectors, and a procedure for correcting code vectors which have been corrupted by errors, into the corresponding code vectors provided that there have been no more than t=(n-k)e+e' errors in the digits of an N digit code vector; and reconstructing said code vector by using any k of said n secondary keys to correct the errors in k×e of said N digit positions of said N digit corrupted code vector followed by using said error correcting code system to correct the remaining errors in no more than t digit positions.
Claim 4
Dependent Claim
132 words
calculating a corrupted code vector by creating errors in each of said T digit positions of said code vector assigned to said secondary keys and in e' randomly chosen digit positions; choosing an error correcting code system comprising a set of code vectors, and a procedure for correcting code vectors which have been corrupted by errors, into the corresponding code vectors provided that there have been no more than t=(n-k)e+e' errors in the digits of an N digit code vector; and reconstructing said code vector by using any k of said n secondary keys to correct the errors in k×e of said N digit positions of said N digit corrupted code vector followed by using said error correcting code system to correct the remaining errors in no more than t digit positions.
Claim 5
Dependent Claim
48 words
A method for generating a certain number of secondary keys and for using some of said secondary keys in cooperation with a corrupted code vector to reconstruct a code vector according to claim 1 wherein: said subset of digit positions corresponding to each secondary key are mutually exclusive.
Claim 6
Dependent Claim
68 words
A method for generating a certain number of secondary keys and for using some of said secondary keys in cooperation with a corrupted code vector to reconstruct a code vector according to claim 1 wherein said method further comprises: a first step of choosing a key and encoding said key into said code vector; and a last step of decoding said reconstructed code vector to yield said key.
Claim 7
Dependent Claim
154 words
A circuit for generating a certain predetermined code vector if a certain number k of secondary keys are presented to the input thereof, comprising: corrupted code vector memory comprising: an output and means for presenting at said output the contents of said memory; combining means comprising: k inputs connected to receive said secondary keys, an input connected to said corrupted code vector memory, an output and means for combining said signals present on said inputs in order to cancel the effect of the errors represented by said secondary keys in said corrupted code vector; error correction means comprising: an input connected to the output of said combining means, an output and means for correcting errors in a certain number of bit positions in the signal presented at the input thereof and for presenting the corrected code vector at said output; and a code vector output connected to said output of said error correction means.
Claim 8
Dependent Claim
154 words
A circuit for generating a certain predetermined code vector if a certain number k of secondary keys are presented to the input thereof, comprising: corrupted code vector memory comprising: an output and means for presenting at said output the contents of said memory; combining means comprising: k inputs connected to receive said secondary keys, an input connected to said corrupted code vector memory, an output and means for combining said signals present on said inputs in order to cancel the effect of the errors represented by said secondary keys in said corrupted code vector; error correction means comprising: an input connected to the output of said combining means, an output and means for correcting errors in a certain number of bit positions in the signal presented at the input thereof and for presenting the corrected code vector at said output; and a code vector output connected to said output of said error correction means.
Claim 9
Dependent Claim
167 words
A lock mechanism for use with a plurality of secondary keys comprising: a plurality of secondary key input means, one for each of said secondary keys; a corrupted code vector source for supplying a code vector which has a certain number of errors; an error removal circuit comprising a pluralilty of inputs, one connected to each of said secondary key input means, an input connected to the output of said corrupted code vector source, an output and means for removing from said corrupted code vector the errors corresponding to the secondary key signals present on said plurality of secondary key input means; an error correction circuit comprising: an input connected to the output of said error removal circuit, an output and means for correcting up to a certain number of errors in the signal presented at the input thereof and for presenting the corrected signal at the output thereof; and an output for presenting the corrected code vector connected to the output of said error correction circuit.
Claim 10
Dependent Claim
167 words
A lock mechanism for use with a plurality of secondary keys comprising: a plurality of secondary key input means, one for each of said secondary keys; a corrupted code vector source for supplying a code vector which has a certain number of errors; an error removal circuit comprising a pluralilty of inputs, one connected to each of said secondary key input means, an input connected to the output of said corrupted code vector source, an output and means for removing from said corrupted code vector the errors corresponding to the secondary key signals present on said plurality of secondary key input means; an error correction circuit comprising: an input connected to the output of said error removal circuit, an output and means for correcting up to a certain number of errors in the signal presented at the input thereof and for presenting the corrected signal at the output thereof; and an output for presenting the corrected code vector connected to the output of said error correction circuit.
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) | 1986-11-21 | 1987-05-23 | 1987-11-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-11-21 | 1991-05-23 | 1991-11-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-11-21 | 1995-05-23 | 1995-11-22 | $7700.00 | Window Closed / Lapsed |