US5276738A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Software data protection mechanism
Assignee: Bull HN Information Systems Inc
•
Filing: 1992-12-17
•
Granted: 1994-01-04
•
Expires: 2012-12-17
Abstract
Abstract A protection mechanism includes means for taking an input binary value and generating a unique key value as well as performing the reverse operation of taking a key value and generating an input binary value. The mechanism includes a scrambler which includes an array having a number of multibit container locations for storing a unique sequence of random numbers. The scrambler forms another binary value by rearranging the bits of the input binary value as a function of the random number values in addition to altering the states of such bits as a function of the random number values and the numeric bit position values of sources of the input binary bits. The resulting binary value is applied to an alphanumeric encoder which converts the binary value into a series of alphanumeric characters containing a valid key value.
Inventors
- 👤 Thomas S. Hirsch
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 10:28
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/14; G06F12/1408; H; H04; H04L; H04L9/00; H04L9/08; H04L9/0861; H04L9/0869
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
227 words
A protection mechanism for generating user key values from input binary values and for transforming key values into binary values in a manner that does not require security precautions for preventing disclosure of the manner of generating said user key values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is being converted into a key value; a pseudo random number generator connected to receive seed and start values, said generator in response to said seed and start values generating repeatable sequences of random number values; a scrambler including an array including n number of multibit containers for storing n number of unique multibit random number values included in said repeatable sequences; said scrambler including means for randomly rearranging said n number of bits of said binary value as a function of said multibit random number values stored in said n number of containers to form a second n bit binary value; and, an alphanumeric encoder operatively coupled to said scrambler for receiving said second n bit binary value, said encoder including a table for storing a plurality of alphanumeric characters, said encoder using portions of said second binary value for referencing different ones of said alphanumeric characters to produce a series of alphanumeric characters representing one of said user key values.
Claim 2
Dependent Claim
227 words
A protection mechanism for generating user key values from input binary values and for transforming key values into binary values in a manner that does not require security precautions for preventing disclosure of the manner of generating said user key values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is being converted into a key value; a pseudo random number generator connected to receive seed and start values, said generator in response to said seed and start values generating repeatable sequences of random number values; a scrambler including an array including n number of multibit containers for storing n number of unique multibit random number values included in said repeatable sequences; said scrambler including means for randomly rearranging said n number of bits of said binary value as a function of said multibit random number values stored in said n number of containers to form a second n bit binary value; and, an alphanumeric encoder operatively coupled to said scrambler for receiving said second n bit binary value, said encoder including a table for storing a plurality of alphanumeric characters, said encoder using portions of said second binary value for referencing different ones of said alphanumeric characters to produce a series of alphanumeric characters representing one of said user key values.
Claim 3
Dependent Claim
72 words
The mechanism of claim 1 wherein said scrambler further includes an output register for storing said second n bit binary value, said scrambler randomly rearranging said n number of bits by moving each of said n number of bits to a new bit position of said output register as a function of one of said n number of unique multidigit random number values stored in a corresponding one of said multibit containers.
Claim 4
Dependent Claim
98 words
The mechanism of claim 2 wherein said each of said n sets of containers includes complementing and non-complementing outputs which operatively connect to said output register and wherein scrambler further includes n number of exclusive OR means, each of said exclusive OR means exclusively ORing numeric bit position and random number values of corresponding ones of said input register and container to produce a least significant bit value whose state selects one of said complement and non-complement outputs for applying a corresponding one of said n number of bits of said input binary value to said output register.
Claim 5
Dependent Claim
71 words
The mechanism of claim 1 wherein said first and second binary values include a predetermined number of bytes and wherein said portions of said second binary value correspond to groups of m number of bits extracted from said second binary value wherein m has a value less than said predetermined number of bytes, said groups of bits being used as indexes into said table for producing said series of alphanumeric characters.
Claim 6
Dependent Claim
29 words
The mechanism of claim 1 wherein said start and seed values are arbitrary values which require safeguarding to prevent duplication of valid keys notwithstanding disclosure of said protection mechanism.
Claim 7
Independent Claim
162 words
A method for generating key values in a manner which does not require security precautions for preventing disclosure of the way in which such key values are generated, said method comprising the steps of: (a) storing in a first register a first binary value having n number of bits which are to be converted into a key value; (b) generating a sequence of random number values by applying seed and start values to a pseudo random number generator; (c) storing n number of unique random number values in a corresponding number of multibit container locations of an array; (d) scrambling said bits of said first binary number by rearranging said n number of bits as a function of said n number of random number values stored in said container locations to produce a second binary value; and, (e) encoding said second binary value into a series of alphanumeric characters which contain n number of bits usable as on of said key values.
Claim 8
Independent Claim
162 words
A method for generating key values in a manner which does not require security precautions for preventing disclosure of the way in which such key values are generated, said method comprising the steps of: (a) storing in a first register a first binary value having n number of bits which are to be converted into a key value; (b) generating a sequence of random number values by applying seed and start values to a pseudo random number generator; (c) storing n number of unique random number values in a corresponding number of multibit container locations of an array; (d) scrambling said bits of said first binary number by rearranging said n number of bits as a function of said n number of random number values stored in said container locations to produce a second binary value; and, (e) encoding said second binary value into a series of alphanumeric characters which contain n number of bits usable as on of said key values.
Claim 9
Dependent Claim
115 words
The method of claim 6 wherein said n number of bits of said first binary value is assigned a corresponding number of numeric bit position values defined by bit positions of said first register and wherein step (d) further includes the steps of: (f) exclusively ORing each of said n number of numeric bit position values of said first binary value and a corresponding one of said n number of multibit random number values to produce n number of least significant bit values; and, (g) using each least significant bit state for determining if a corresponding one of said n number of bits of said first binary value is to be complemented before being encoded.
Claim 10
Dependent Claim
68 words
The method of claim 7 wherein step (g) further includes the step of complementing said corresponding one of said n number of bits of said first binary value prior to encoding when said each least significant bit is in a first state and not complementing said corresponding one of said n number of said first binary value when said each least significant bit is in a second state.
Claim 11
Dependent Claim
19 words
The method of claim 8 wherein said first and second states correspond to binary ONE and ZERO states, respectively.
Claim 12
Dependent Claim
59 words
The method of claim 6 wherein said first and second binary values, each include a predetermined number of bytes and wherein step (e) of said method includes the step of: (i) using different portions of each byte of said second binary value as indexes into a table for referencing different alphanumeric characters to produce said series of alphanumeric characters.
Claim 13
Dependent Claim
38 words
The method of claim 10 wherein said different portions correspond to groups of m number of bits extracted from each byte of said second binary value wherein m has a value less than said predetermined number of bytes.
Claim 14
Dependent Claim
177 words
A protection mechanism for generating user key values from input binary values and for transforming key values into binary values in a manner that does not require security precautions for preventing disclosure of the manner of generating said user key values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is being converted into a user key value; a pseudo random number generator connected to receive seed and start values, said generator in response to said seed and start values generating repeatable sequences of random number values; a scrambler including an array including n number of multibit containers for storing n number of unique multibit random number values included in said repeatable sequences; and, said scrambler including means for randomly rearranging said n number of bits of said binary value as a function of said multibit random number values stored in said n number of containers to form a second n bit binary value representative of one of said user key values.
Claim 15
Dependent Claim
177 words
A protection mechanism for generating user key values from input binary values and for transforming key values into binary values in a manner that does not require security precautions for preventing disclosure of the manner of generating said user key values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is being converted into a user key value; a pseudo random number generator connected to receive seed and start values, said generator in response to said seed and start values generating repeatable sequences of random number values; a scrambler including an array including n number of multibit containers for storing n number of unique multibit random number values included in said repeatable sequences; and, said scrambler including means for randomly rearranging said n number of bits of said binary value as a function of said multibit random number values stored in said n number of containers to form a second n bit binary value representative of one of said user key values.
Claim 16
Dependent Claim
155 words
A protection mechanism for generating user key values from input binary values and for transforming key values into said input binary values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is either being converted into a user key value or has been transformed into an input binary value; and, an alphanumeric encoder/decoder operatively coupled to said input register for receiving said first n bit binary value, said encoder/decoder including a table for storing a plurality of alphanumeric characters, said encoder/decoder using portions of said second binary value for referencing different ones of said alphanumeric characters to produce a series of alphanumeric characters representing one of said user key values and said encoder/decoder using each of said series of alphanumeric characters as index into said table for transforming said series of alphanumeric characters into one of said input binary values.
Claim 17
Dependent Claim
155 words
A protection mechanism for generating user key values from input binary values and for transforming key values into said input binary values, said mechanism comprising: an input register having n number of bit positions for storing a first binary value having n number of bits which is either being converted into a user key value or has been transformed into an input binary value; and, an alphanumeric encoder/decoder operatively coupled to said input register for receiving said first n bit binary value, said encoder/decoder including a table for storing a plurality of alphanumeric characters, said encoder/decoder using portions of said second binary value for referencing different ones of said alphanumeric characters to produce a series of alphanumeric characters representing one of said user key values and said encoder/decoder using each of said series of alphanumeric characters as index into said table for transforming said series of alphanumeric characters into one of said input binary values.
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) | 1997-01-03 | 1997-07-05 | 1998-01-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-01-03 | 2001-07-05 | 2002-01-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-01-03 | 2005-07-05 | 2006-01-04 | $7700.00 | Window Closed / Lapsed |