US5757923A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of generating secret identification numbers
Assignee: Lear Corp EEDS and Interiors
•
Filing: 1996-04-19
•
Granted: 1998-05-26
•
Expires: 2016-04-19
Abstract
Abstract The present invention teaches a method of generating a secret identification number from a random digital data stream. The method comprises the step of initially selecting a first and a second group of bytes from the random digital data stream, wherein the first and second groups of bytes have a first and second numerical value. Subsequently, a first maximal length LFSR feedback term is looked up from a list in response to said first numerical value, while a second maximal length LFSR feedback term is looked up from the list in response to said second numerical value. The method additionally comprises the step of generating a cyclic redundancy code feedback term in response to executing a cyclic redundancy code check on a third group of bytes selected from the random digital data stream. Moreover, the method comprises the step of forming the secret identification number from the first and second maximal length LFSR feedback terms, the cyclic redundancy code feedback term, and a fourth group of bytes from the random digital data stream.
Inventors
- 👤 Philip J. Koopman, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 06:03
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/001; G; G06; G06F; G06F7/00; G06F7/58; G06F7/582; G06F7/584; G06F7/588; H04L9/08; H04L9/0861; G06F2207/00; G06F2207/58; G06F2207/581
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
120 words
A method of generating a secret identification number from a random digital data stream, the method comprising the steps of: selecting a first group of bytes from the random digital data stream, said first group of bytes having a first numerical value; looking up a first maximal length LFSR feedback term from a list in response to said first numerical value; generating a cyclic redundancy code feedback term in response to filtering out predetermined values from a third group of bytes selected from said random digital data stream; and forming the secret identification number from said first maximal length LFSR feedback term, said cyclic redundancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 2
Independent Claim
120 words
A method of generating a secret identification number from a random digital data stream, the method comprising the steps of: selecting a first group of bytes from the random digital data stream, said first group of bytes having a first numerical value; looking up a first maximal length LFSR feedback term from a list in response to said first numerical value; generating a cyclic redundancy code feedback term in response to filtering out predetermined values from a third group of bytes selected from said random digital data stream; and forming the secret identification number from said first maximal length LFSR feedback term, said cyclic redundancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 3
Dependent Claim
78 words
The method of generating a secret identification number from a random digital data stream of claim 1, wherein said step of generating a cyclic redundancy code feedback term comprises the steps of: examining whether said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits; and generating a replacement feedback term for said cyclic redundancy code feedback term if said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits.
Claim 4
Dependent Claim
100 words
The method of generating a secret identification number from a random digital data stream of claim 1, further comprising the steps of: selecting a second group of bytes from the random digital data stream, said second group of bytes having a second numerical value; and looking up a second maximal length LFSR feedback term from a list in response to said second numerical value such that said secret identification number is formed from said first and second maximal length LFSR feedback terma, said cyclic redundancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 5
Dependent Claim
156 words
The method of generating a secret identification number from a random digital data stream of claim 3, further comprising the steps of: repeating the steps of randomly selecting a first and a second group of bytes, looking up a first maximal length LFSR feedback term, looking up a second maximal length LFSR feedback term, generating a cyclic redundancy code feedback term, N times to create N secret identification numbers; one way encrypting each of said N secret identification numbers; computing a secure digest for each one way encrypted secret identification number of said N secret identification numbers; comparing each one way encrypted secret identification number of said N secret identification numbers with each other one way encrypted secret identification number of said N secret identification numbers within said digest; and discarding each one way encrypted secret identification number of said multiplicity within said digest when two identical compressed one way encrypted secret identification number are discovered.
Claim 6
Independent Claim
54 words
A method for generating a multiplicity of random numbers, the method comprising the steps of: generating chaotic noise; sampling said chaotic noise such that a plurality of samples are created; converting said plurality of samples into a random digital data stream; and forming the multiplicity of random numbers from said random digital data stream.
Claim 7
Independent Claim
54 words
A method for generating a multiplicity of random numbers, the method comprising the steps of: generating chaotic noise; sampling said chaotic noise such that a plurality of samples are created; converting said plurality of samples into a random digital data stream; and forming the multiplicity of random numbers from said random digital data stream.
Claim 8
Dependent Claim
38 words
The method for generating a multiplicity of random numbers of claim 5, wherein said step of forming the multiplicity of random numbers comprises: shuffling said plurality of converted samples to obscure correlations between the multiplicity of random numbers.
Claim 9
Dependent Claim
44 words
The method for generating a multiplicity of random numbers of claim 5, wherein said step of forming the multiplicity of random numbers comprises: compressing said plurality of converted samples such that each random number of the multiplicity has an equal probability of being generated.
Claim 10
Dependent Claim
51 words
The method for generating a multiplicity of random numbers of claim 5, wherein said step of forming the multiplicity of random numbers comprises: one way encrypting said plurality of converted samples to prevent sampling the random digital data stream for extrapolating other generated values based on modeling said generated chaotic noise.
Claim 11
Dependent Claim
39 words
The method for generating a multiplicity of random numbers of claim 8, further comprising the step of: examining said one way encrypted plurality of converted samples for duplicate converted samples; and discarding said duplicate one way encrypted converted samples.
Claim 12
Dependent Claim
40 words
The method for generating a multiplicity of random numbers of claim 8, further comprising the step of: exclusively ORing an independent perspective marker with said compressed plurality of converted samples to insure the randomness of the multiplicity of random numbers.
Claim 13
Dependent Claim
27 words
The method for generating a multiplicity of random numbers of claim 5, wherein said step of generating chaotic noise comprises the step of: generating turbulent air flow.
Claim 14
Dependent Claim
33 words
The method for generating a multiplicity of random numbers of claim 11, wherein said step of generating turbulent air flow comprises the step of: operating a fan for generating said turbulent air flow.
Claim 15
Dependent Claim
27 words
The method for generating a multiplicity of random numbers of claim 12, wherein said step of sampling is performed at a lower frequency than said fan operates.
Claim 16
Dependent Claim
120 words
The method for generating a multiplicity of random numbers of claim 5, wherein said further comprising the steps of: selecting a first group of bytes from said random digital data stream, said first group of bytes having a first numerical value, respectively; looking up a first maximal length LFSR feedback term from a list in response to said first numerical value; generating a cyclic redudancy code feedback term in response to filtering out predetermined values from a third group of bytes selected from said random digital data stream; and forming a secret identification number from said first maximal length LFSR feedback term, said cyclic redudancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 17
Dependent Claim
72 words
The method for generating a multiplicity of random numbers of claim 14, wherein said step of generating a cyclic redudancy code feedback term comprises the step: examing whether said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits; and generating a replacement feedback term for said cyclic redundancy code feedback term if said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits.
Claim 18
Dependent Claim
95 words
The method for generating a multiplicity of random numbers of claim 14, further comprising the steps of: selecting a second group of bytes from the random digital data stream, said second group of bytes having a second numerical value; and looking up a second maximal length LFSR feedback term from a list in response to said second numerical value such that said secret identification number is formed from said first and second maximal length LFSR feedback terma, said cyclic redundancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 19
Dependent Claim
136 words
The method for generating a multiplicity of random numbers of claim 16, further comprising the steps of: repeating the steps of randomly selecting a first and a second group of bytes, looking up a first maximal length LFSR feedback term, looking up a second maximal length LFSR feedback term, generating a cyclic redudancy code feedback term, N times to create N secret identification numbers; one way encrypting each of said N secret identification numbers; computing a secure digest of each one way encrypted secret identification number of said N secret identification numbers; comparing each one way encrypted secret identification number of said N secret identification numbers within said digest; and discarding each one way encrypted secret identification number of said multiplicity within said digest when two identical compressed one way encrypted secret identification number are discovered.
Claim 20
Dependent Claim
102 words
A process for generating a multipicity of secure random numbers, the process comprising: generating chaotic noise from turbulent air flow; sampling said chaotic noise such that a plurality of samples are created; converting said plurality of samples into a random digital data stream; shuffling said plurality of converted samples to obscure correlations between the multiplicity of random numbers; compressing said shuffled plurality of converted samples such that each random number of the mulitplicity has an equal probability of being generated; and one way encrypting said compressed plurality of shuffled and converted samples such that the plurality of secure random numbers are created.
Claim 21
Dependent Claim
102 words
A process for generating a multipicity of secure random numbers, the process comprising: generating chaotic noise from turbulent air flow; sampling said chaotic noise such that a plurality of samples are created; converting said plurality of samples into a random digital data stream; shuffling said plurality of converted samples to obscure correlations between the multiplicity of random numbers; compressing said shuffled plurality of converted samples such that each random number of the mulitplicity has an equal probability of being generated; and one way encrypting said compressed plurality of shuffled and converted samples such that the plurality of secure random numbers are created.
Claim 22
Dependent Claim
52 words
The process for generating a multiplicity of secure random numbers of claim 18, wherein said step of shuffling said digital data set comprises the step of: positioning each converted sample of said plurality into a data array using a stride to reduce sampling correlations resulting from said sampling of said chaotic noise.
Claim 23
Dependent Claim
33 words
The process for generating a multiplicity of secure random numbers of claim 19, wherein said array comprises a width, said stride comprises a size, said width and said size being a prime number.
Claim 24
Dependent Claim
54 words
The process for generating a multiplicity of secure random numbers of claim 18, wherein said step of compressing said shuffled plurality of converted samples comprises the step of: Huffman encoding said shuffled plurality of converted samples; or PKZIP compressing said shuffled plurality of converted samples; or UNIX compressing said shuffled plurality of converted samples.
Claim 25
Dependent Claim
86 words
The process for generating a multiplicity of secure random numbers of claim 18, wherein said step of one way encrypting said compressed plurality of shuffled and converted samples comprises the step of: MD-2 encrypting said compressed plurality of shuffled and converted samples; or MD-4 encrypting said compressed plurality of shuffled and converted samples; or MD-5 encrypting said compressed plurality of shuffled and converted samples; or SHA encrypting said compressed plurality of shuffled and converted samples; or SNEFRU encrypting said compressed plurality of shuffled and converted samples.
Claim 26
Dependent Claim
47 words
The process for generating a multiplicity of secure random numbers of claim 18, further comprising the step of: examining each encrypted sample of said plurality for a duplicate encrypted sample; and discarding said duplicate encrypted sample to insure the uniqueness of each random number of the plurality.
Claim 27
Dependent Claim
43 words
The process for generating a multiplicity of secure random numbers of claim 18, further comprising the step of: exclusively ORing an independent perspective marker with said compressed plurality of shuffled and converted samples to insure the randomness of the multiplicity of random numbers.
Claim 28
Dependent Claim
24 words
The process for generating a multiplicity of secure random numbers of claim 24, wherein said independent perspective marker comprises a time of day stamp.
Claim 29
Dependent Claim
37 words
The process for generating a multiplicity of secure random numbers of claim 18, wherein said step of generating chaotic noise from turbulent air flow comprises the step of: operating a fan for generating said turbulent air flow.
Claim 30
Dependent Claim
28 words
The process for generating a multiplicity of secure random numbers of claim 24, wherein said step of sampling is performed at a lower frequency than said fan operates.
Claim 31
Dependent Claim
149 words
The process for generating a multiplicity of secure random numbers of claim 18, further comprising the steps of: randomly selecting a first and a second group of bytes from said random digital data stream, said first and second groups of bytes having a first and a second numerical value, respectively; looking up a first maximal length LFSR feedback term from a list according to said first numerical value; looking up a second maximal length LFSR feedback term from said list according to said second numerical value; generating a cyclic redudancy code feedback term in response to executing a cyclic redudancy code check on a third group of bytes selected from said random digital data stream; and forming a secret identification number from said first and second maximal length LFSR feedback terms, said cyclic redudancy code feedback term, and a fourth group of bytes from said random digital data stream.
Claim 32
Dependent Claim
74 words
The process for generating a multiplicity of secure random numbers of claim 28, wherein said step of generating a cyclic redudancy code feedback term comprises the steps of: examing whether said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits; and generating a replacement feedback term for said cyclic redundancy code feedback term if said cyclic redundancy code feedback term comprises less than two "0" bits or "1" bits.
Claim 33
Dependent Claim
137 words
The process for generating a multiplicity of secure random numbers of claim 28, further comprising the steps of: repeating the steps of randomly selecting a first and a second group of bytes, looking up a first maximal length LFSR feedback term, looking up a second maximal length LFSR feedback term, generating a cyclic redudancy code feedback term, N times to create N secret identification numbers; one way encrypting each of said N secret identification numbers; computing a secure digest of each one way encrypted secret identification number of said N secret identification numbers; comparing each one way encrypted secret identification number of said N secret identification numbers within said digest; and discarding each one way encrypted secret identification number of said multiplicity within said digest when two identical compressed one way encrypted secret identification number are discovered.
References Cited (Backward Citations)
US4424414A
Cited
US4853884A
Cited
US5048086A
Cited
US5434806A
Cited
US5363448A
Cited
US5398284A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-05-25 | 2001-11-24 | 2002-05-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-05-25 | 2005-11-24 | 2006-05-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-05-25 | 2009-11-24 | 2010-05-26 | $7700.00 | Window Closed / Lapsed |