US5541996A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for a pseudo-random number generator for high precision numbers
Assignee: Exelis Inc
•
Filing: 1994-12-12
•
Granted: 1996-07-30
•
Expires: 2014-12-12
Abstract
Abstract The present invention pseudo-random number generator produces a high precision number suitable for use as a data encryption communications security (COMSEC) key from a highly mobile computer platform. The random number generator is especially suitable for use with military radios and other like applications requiring a random number bit string of high precision. The present invention random number generator produces four pseudo-random numbers of 32-bits and uses only the last 28 bits of each number. A multiplicative linear congruential generator with multiplier 16807 and prime modulus 2 31 -1 is used to produce the 32-bit pseudo-random numbers. This generator produces a sequence of remainders of large modulus. The last 28 bits of the 32-bit numbers are combined to produce one high precision number of 112 bits. The first 28-bit number would be shifted left 84 bits, the second 28-bit number would be shifted left 56 bits, the third 28-bit number would be shifted left 28 bits and the last 28-bit number would not be shifted. The three shifted results would be logically ORed together to produce the 112-bit pseudo-random number. The high precision number preserves the statistical nature of the low precision pseudo-random numbers.
Inventors
- 👤 Nancy M. Ridenour
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 09:38
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L2209/00; H04L2209/04; H04L2209/046
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
104 words
An apparatus for generating a high precision pseudo-random number, said pseudo-random number indicative of a communications security key for data encryption, said apparatus comprising: means for generating intermediate random numbers according to a predetermined mathematical transformation; means for storing said intermediate random numbers including means for processing said intermediate numbers into a second predetermined form; means for masking a predetermined portion of said intermediate random numbers to thereby form reduced intermediate random numbers; and means for storing multiple ones of said reduced intermediate random numbers together in a security key buffer to produce said high precision number for use as said communications security key.
Claim 2
Independent Claim
104 words
An apparatus for generating a high precision pseudo-random number, said pseudo-random number indicative of a communications security key for data encryption, said apparatus comprising: means for generating intermediate random numbers according to a predetermined mathematical transformation; means for storing said intermediate random numbers including means for processing said intermediate numbers into a second predetermined form; means for masking a predetermined portion of said intermediate random numbers to thereby form reduced intermediate random numbers; and means for storing multiple ones of said reduced intermediate random numbers together in a security key buffer to produce said high precision number for use as said communications security key.
Claim 3
Dependent Claim
15 words
The apparatus of claim 1, wherein said predetermined mathematical transformation is a linear congruential transformation.
Claim 4
Dependent Claim
27 words
The apparatus of claim 2, wherein said linear congruential transformation is in the form of: X.sub.i+1 =(ax.sub.i +b) mod m where, n≧0, a=multiplier, b=increment, and m=modulus. 4.
Claim 5
Dependent Claim
28 words
The apparatus of claim 1, further including output means for outputting said high precision number to a remote location for use as a data encryption communications security key.
Claim 6
Dependent Claim
74 words
The apparatus of claim 1, wherein said means for storing said intermediate numbers includes shift register means for shifting a first stored intermediate random number 84 bit places to the left, for shifting a second stored intermediate random number 56 bit places to the left, and for shifting a third stored intermediate random number 28 bit places to the left, wherein a fourth intermediate random number stored in said shift register means remains unshifted.
Claim 7
Dependent Claim
26 words
The apparatus of claim 5, wherein said means for storing said reduced intermediate numbers stores said reduced intermediate numbers to produce a 112-bit high precision number.
Claim 8
Independent Claim
167 words
An apparatus for generating a high precision random number communications security key used in a data encryption system, said data encryption system encrypts a transmitted message to a remote receiver wherein said message is decrypted by said receiver if said security key is known at said receiver, said apparatus comprising: processor means for generating intermediate random numbers according to a linear congruential transformation; a plurality of shift register means coupled to said processor means for storing and shifting said intermediate random numbers; logic means coupled to each of said shift register means for performing logical operations on numbers stored in said shift register means; masking means coupled to said shift register means for masking off a predetermined portion of said intermediate random numbers to thereby form reduced intermediate random numbers; combining means coupled to said shift register means for combining said reduced intermediate random numbers into said high precision random number comprising multiple reduced intermediate random numbers; and storage buffer means for storing said high precision number.
Claim 9
Independent Claim
167 words
An apparatus for generating a high precision random number communications security key used in a data encryption system, said data encryption system encrypts a transmitted message to a remote receiver wherein said message is decrypted by said receiver if said security key is known at said receiver, said apparatus comprising: processor means for generating intermediate random numbers according to a linear congruential transformation; a plurality of shift register means coupled to said processor means for storing and shifting said intermediate random numbers; logic means coupled to each of said shift register means for performing logical operations on numbers stored in said shift register means; masking means coupled to said shift register means for masking off a predetermined portion of said intermediate random numbers to thereby form reduced intermediate random numbers; combining means coupled to said shift register means for combining said reduced intermediate random numbers into said high precision random number comprising multiple reduced intermediate random numbers; and storage buffer means for storing said high precision number.
Claim 10
Dependent Claim
29 words
The apparatus according to claim 7, further including output means for outputting said high precision number to a remote location for use as a data encryption communications security key.
Claim 11
Dependent Claim
27 words
The apparatus according to claim 7, wherein said linear congruential transformation is in the form of: X.sub.i+1 =(ax.sub.i +b) mod m where, n≧0, a=multiplier, b=increment, and m=modulus.
Claim 12
Dependent Claim
19 words
The apparatus according to claim 9, wherein the multiplier is 16807 and the prime modulus is 2 31 -1.
Claim 13
Dependent Claim
15 words
The apparatus according to claim 7, wherein said processor means generates 32-bit pseudo-random intermediate numbers.
Claim 14
Dependent Claim
83 words
The apparatus according to claim 11, wherein said plurality of shift register means comprises a first shift register for shifting a first stored intermediate random number 84 bit places to the left, a second shift register for shifting a second stored intermediate random number 56 bit places to the left, a third shift register for shifting a third stored intermediate random number 28 bit places to the left and a fourth shift register for storing a fourth intermediate random number which remains unshifted.
Claim 15
Dependent Claim
31 words
The apparatus according to claim 12, wherein said combining means is operable to combine said intermediate random numbers in said first through fourth shift registers into a 112-bit high precision number.
Claim 16
Dependent Claim
30 words
The apparatus according to claim 11, wherein said masking means masks off the four most significant bits of an intermediate random number, thereby leaving a 28-bit reduced intermediate random number.
Claim 17
Dependent Claim
15 words
The apparatus according to claim 7, wherein said processor means is a portable digital computer.
Claim 18
Independent Claim
142 words
A method for generating a high precision communications security key for use in a data encryption system, said data encryption system encrypts a transmitted message to a remote receiver, wherein said message is decrypted by said receiver if said security key is known at said receiver, said method comprising the steps of: generating a series of intermediate random numbers according to a linear congruential transformation; storing said intermediate random numbers in a plurality of shift register means; shifting said intermediate random numbers stored in said shift register means in order that the bit strings of said intermediate random numbers are combined side by side without any gaps in between; combining said intermediate random numbers that have been shifted into a high precision random number formed from multiple intermediate random numbers; storing said high precision random number in a communications security key buffer.
Claim 19
Independent Claim
142 words
A method for generating a high precision communications security key for use in a data encryption system, said data encryption system encrypts a transmitted message to a remote receiver, wherein said message is decrypted by said receiver if said security key is known at said receiver, said method comprising the steps of: generating a series of intermediate random numbers according to a linear congruential transformation; storing said intermediate random numbers in a plurality of shift register means; shifting said intermediate random numbers stored in said shift register means in order that the bit strings of said intermediate random numbers are combined side by side without any gaps in between; combining said intermediate random numbers that have been shifted into a high precision random number formed from multiple intermediate random numbers; storing said high precision random number in a communications security key buffer.
Claim 20
Dependent Claim
27 words
The method of claim 16, further including the step of masking off predetermined portions of said intermediate random numbers in order to form reduced intermediate random numbers.
Claim 21
Dependent Claim
44 words
The method of claim 17, wherein said random intermediate numbers are 32-bits in length, and wherein said step of masking includes the step of masking off the four most significant bits of an intermediate random number, thereby leaving a 28-bit reduced intermediate random number.
Claim 22
Dependent Claim
66 words
The method of claim 18, wherein four different intermediate random numbers are stored in said shift register means, wherein a first intermediate random number is shifted 84 bit places to the left, a second intermediate random number is shifted 56 bit places to the left, a third intermediate random number is shifted 28 bit places to the left and a fourth intermediate random number remains unshifted.
Claim 23
Dependent Claim
24 words
The method of claim 19, wherein said first through fourth intermediate random numbers are logically ORed together to produce a 112-bit high precision number.
Claim 24
Dependent Claim
52 words
The method of claim 19, wherein a seed value is used to generate said intermediate random numbers and wherein an initial seed value is exclusively-ORed with a bit string representation of the current time and date prior to use as said seed value, thereby further increasing the randomness of said seed value.
Claim 25
Dependent Claim
33 words
The method of claim 19, wherein the seed values for said second through fourth intermediate random numbers are each shifted one bit left prior to their use in generating said intermediate random numbers.
Claim 26
Dependent Claim
28 words
The method of claim 16, further including the step of outputting said high precision number to a remote location for use as a data encryption communications security key.
Claim 27
Dependent Claim
26 words
The method of claim 16, wherein said linear congruential transformation is in the form of: X.sub.i+1 =(ax.sub.i +b) mod m where, n≧0, a=multiplier, b=increment, and m=modulus.
Claim 28
Dependent Claim
18 words
The method of claim 24, wherein the multiplier is 16807 and the prime modulus is 2 31 -1.
Claim 29
Dependent Claim
17 words
The method of claim 16, wherein said intermediate random numbers are generated from a portable digital computer.
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) | 1999-07-30 | 2000-01-29 | 2000-07-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-30 | 2004-01-29 | 2004-07-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-30 | 2008-01-29 | 2008-07-30 | $7700.00 | Window Closed / Lapsed |