Patent US5420928A successfully refreshed from Google Patents.
US5420928A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pseudo-random generator
Assignee: George Washington University
•
Filing: 1994-01-25
•
Granted: 1995-05-30
•
Expires: 2014-01-25
Abstract
Abstract Methodology and concomitant circuitry to generate cryptographically strong pseudo-random bit streams utilize secure block cypher encoders. Typically, each block cypher encoder has a first seed and a random key as an input. In the most basic realization of the methodology and circuitry, the output of each encoder is fed back to connect to its input. The first seed serves as the initial input, and each subsequent input is the immediate output. Each bit in the cryptographically strong pseudo-random bit stream is related to an inner product between each input to the encoder and a second seed.
Inventors
- 👤 William A. Aiello
- 👤 Ramarathnam Venkatesan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:33
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L2209/00; H04L2209/12; H04L2209/125
Claims Analysis
Total Claims: 47
Claim 1
Independent Claim
102 words
A method for generating a stream of cryptographically strong pseudo-random bits with: a block cypher encoder having a fixed random encoder key; and first and second seeds of the same length, the method comprising the steps of (a) inputing the first seed as the first input to the block cypher encoder, (b) generating an output bit in the stream in correspondence to an inner product between the input of the block cypher encoder and the second seed, and (c) feeding back the output of the block cypher encoder as the next input to the block cypher encoder, and returning to step (b).
Claim 2
Independent Claim
102 words
A method for generating a stream of cryptographically strong pseudo-random bits with: a block cypher encoder having a fixed random encoder key; and first and second seeds of the same length, the method comprising the steps of (a) inputing the first seed as the first input to the block cypher encoder, (b) generating an output bit in the stream in correspondence to an inner product between the input of the block cypher encoder and the second seed, and (c) feeding back the output of the block cypher encoder as the next input to the block cypher encoder, and returning to step (b).
Claim 3
Dependent Claim
45 words
The method as recited in claim 1 wherein said step of generating said output bit includes the steps of bitwise ANDing the input of the block cypher encoder and the second seed, and outputting the parity of said bitwise ANDing step as said output bit.
Claim 4
Independent Claim
107 words
A method for generating a stream of cryptographically strong pseudo-random bits with: a block cypher encoder having a fixed random encoder key; and a first seed and S second seeds all of the same length, the method comprising the steps of (a) inputing the first seed as the first input to the block cypher encoder, (b) generating S output bits in the stream in correspondence to S inner products between the input of the block cypher encoder and the S second seeds, and (c) feeding back the output of the block cypher encoder as the next input to the block cypher encoder, and returning to step (b).
Claim 5
Independent Claim
107 words
A method for generating a stream of cryptographically strong pseudo-random bits with: a block cypher encoder having a fixed random encoder key; and a first seed and S second seeds all of the same length, the method comprising the steps of (a) inputing the first seed as the first input to the block cypher encoder, (b) generating S output bits in the stream in correspondence to S inner products between the input of the block cypher encoder and the S second seeds, and (c) feeding back the output of the block cypher encoder as the next input to the block cypher encoder, and returning to step (b).
Claim 6
Dependent Claim
56 words
The method as recited in claim 3 wherein said step of generating said S output bits includes the steps of bitwise ANDing the input of the block cypher encoder and a corresponding one of the S second seeds, and outputting the parity of said bitwise ANDing step as the corresponding one of said S output bits.
Claim 7
Independent Claim
119 words
A method for generating a stream of cryptographically strong pseudo-random bits in groups of N with: N block cypher encoders wherein each of the encoders has a different fixed random key; and N first and N second seeds, all of the same length, the method comprising the steps of (a) inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, (b) concurrently generating the output bit I in each group in correspondence to an inner product between the input to the encoder I and the corresponding second seed I, and (c) feeding back the output of each encoder I as its next input, and returning to step (b).
Claim 8
Independent Claim
119 words
A method for generating a stream of cryptographically strong pseudo-random bits in groups of N with: N block cypher encoders wherein each of the encoders has a different fixed random key; and N first and N second seeds, all of the same length, the method comprising the steps of (a) inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, (b) concurrently generating the output bit I in each group in correspondence to an inner product between the input to the encoder I and the corresponding second seed I, and (c) feeding back the output of each encoder I as its next input, and returning to step (b).
Claim 9
Dependent Claim
47 words
The method as recited in claim 5 wherein said step of generating the output bit I includes the steps of bitwise ANDing the input of the encoder I and the second seed I, and outputting the parity of the bitwise ANDing step as the output bit I.
Claim 10
Independent Claim
128 words
A method for generating a stream of cryptographically strong pseudo-random bits in groups of NS with: N block cypher encoders wherein each of the encoders has a different fixed random key; N first and NS second seeds, all of the same length, the method comprising the steps of (a) inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, (b) concurrently generating the output bits I,J, J=1, 2, . . . , S, in each group of NS bits in correspondence to an inner product between the input to the encoder I and the corresponding second seed I,J, and (c) feeding back the output of each encoder I as its next input, and returning to step (b).
Claim 11
Independent Claim
128 words
A method for generating a stream of cryptographically strong pseudo-random bits in groups of NS with: N block cypher encoders wherein each of the encoders has a different fixed random key; N first and NS second seeds, all of the same length, the method comprising the steps of (a) inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, (b) concurrently generating the output bits I,J, J=1, 2, . . . , S, in each group of NS bits in correspondence to an inner product between the input to the encoder I and the corresponding second seed I,J, and (c) feeding back the output of each encoder I as its next input, and returning to step (b).
Claim 12
Dependent Claim
68 words
The method as recited in claim 7 wherein said step of generating said output bits I,J, J=1, 2, . . . , S includes the steps of bitwise ANDing the input of the encoder I and the second seed I,J, J=1, 2, . . . , S, and outputting the parity of the bitwise ANDing step as the output bits I,J, J=1, 2, . . . , S.
Claim 13
Independent Claim
128 words
A method for generating a stream of cryptographically strong pseudo-random bits with: two block cypher encoders wherein the fixed random encoder key is different for each of the encoders; and first and second seeds of the same length, the method comprising the steps of (a) interconnecting the two block cypher encoders such that the output of the first encoder serves as the input to the second encoder, (b) inputing the first seed as the first input to the first encoder, (c) generating an output bit in the stream in correspondence to an inner product between the input of the first encoder and the second seed, and (d) feeding back the output of the second encoder as the next input to the first encoder, and returning to step (c).
Claim 14
Independent Claim
128 words
A method for generating a stream of cryptographically strong pseudo-random bits with: two block cypher encoders wherein the fixed random encoder key is different for each of the encoders; and first and second seeds of the same length, the method comprising the steps of (a) interconnecting the two block cypher encoders such that the output of the first encoder serves as the input to the second encoder, (b) inputing the first seed as the first input to the first encoder, (c) generating an output bit in the stream in correspondence to an inner product between the input of the first encoder and the second seed, and (d) feeding back the output of the second encoder as the next input to the first encoder, and returning to step (c).
Claim 15
Dependent Claim
44 words
The method as recited in claim 9 wherein said step of generating said output bit includes the steps of bitwise ANDing the input of the first encoder and the second seed, and outputting the parity of said bitwise ANDing step as said output bit.
Claim 16
Independent Claim
133 words
A method for generating a stream of cryptographically strong pseudo-random bits with: two block cypher encoders wherein the fixed random encoder key is different for each of the encoders; and a first seed and S second seeds all of the same length, the method comprising the steps of (a) interconnecting the two block cypher encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed as the first input of the first encoder, (c) generating S output bits in the stream in correspondence to S inner products between the input of the first encoder and the S second seeds, and (d) feeding back the output of the second encoder as the next input to the first encoder, and returning to step (c).
Claim 17
Independent Claim
133 words
A method for generating a stream of cryptographically strong pseudo-random bits with: two block cypher encoders wherein the fixed random encoder key is different for each of the encoders; and a first seed and S second seeds all of the same length, the method comprising the steps of (a) interconnecting the two block cypher encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed as the first input of the first encoder, (c) generating S output bits in the stream in correspondence to S inner products between the input of the first encoder and the S second seeds, and (d) feeding back the output of the second encoder as the next input to the first encoder, and returning to step (c).
Claim 18
Dependent Claim
55 words
The method as recited in claim 11 wherein said step of generating said S output bits includes the steps of bitwise ANDing the input of the first encoder and a corresponding one of the S second seeds, and outputting the parity of said bitwise ANDing step as the corresponding one of said S output bits.
Claim 19
Independent Claim
174 words
A method for generating a stream of cryptographically strong pseudo-random bits in sets of N with: a plurality N of two-block cypher encoders wherein the fixed random encoder key is different for each of the encoders in the two-block encoders; and N first seeds and N second seeds all of the same length, the method comprising the steps of (a) interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, (c) concurrently generating the output bit I in a corresponding one of the sets in correspondence to an inner product between the input to the two-block encoder I and the corresponding second seed I, and (d) feeding back the output of each second encoder of the two-block encoder I as the next input to the first encoder of the two-block encoder I, and returning to step (c).
Claim 20
Independent Claim
174 words
A method for generating a stream of cryptographically strong pseudo-random bits in sets of N with: a plurality N of two-block cypher encoders wherein the fixed random encoder key is different for each of the encoders in the two-block encoders; and N first seeds and N second seeds all of the same length, the method comprising the steps of (a) interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, (c) concurrently generating the output bit I in a corresponding one of the sets in correspondence to an inner product between the input to the two-block encoder I and the corresponding second seed I, and (d) feeding back the output of each second encoder of the two-block encoder I as the next input to the first encoder of the two-block encoder I, and returning to step (c).
Claim 21
Dependent Claim
53 words
The method as recited in claim 13 wherein said step of generating the output bit I includes the steps of bitwise ANDing the input to the first encoder of the two-block encoder I and the corresponding second seed I, and outputting the parity of the bitwise ANDing step as said output bit I.
Claim 22
Independent Claim
187 words
A method for generating a stream of cryptographically strong pseudo-random bits in sets of NS with: a plurality N of two-block cypher encoders wherein the fixed random encoder key is different for each of the encoders in the two-block encoders; and N first seeds and NS second seeds all of the same length, the method comprising the steps of (a) interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, (c) concurrently generating the output bits I,J, J=1,2, . . . , S, in a corresponding one of the sets of NS bits in correspondence to an inner product between the input to the first encoder of the two-block encoder I and the corresponding second seed I,J and (d) feeding back the output of each second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I, and returning to step (c).
Claim 23
Independent Claim
187 words
A method for generating a stream of cryptographically strong pseudo-random bits in sets of NS with: a plurality N of two-block cypher encoders wherein the fixed random encoder key is different for each of the encoders in the two-block encoders; and N first seeds and NS second seeds all of the same length, the method comprising the steps of (a) interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, (b) inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, (c) concurrently generating the output bits I,J, J=1,2, . . . , S, in a corresponding one of the sets of NS bits in correspondence to an inner product between the input to the first encoder of the two-block encoder I and the corresponding second seed I,J and (d) feeding back the output of each second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I, and returning to step (c).
Claim 24
Dependent Claim
69 words
The method as recited in claim 15 wherein said step of generating said output bits I,J, J=1, 2, . . . , S includes the steps of bitwise ANDing the input of the two-block encoder I and the second seed I,J, J=1, 2, . . . , S, and outputting the parity of the bitwise ANDing step as the output bits I,J, J=1, 2, . . . , S.
Claim 25
Independent Claim
317 words
A method for generating a cryptographically strong pseudo-random function wherein a function index is composed of first and second seeds each of length n and a key for a block cypher encoder, wherein the input to the function is composed of an m bit string, the method comprising the steps of (a) feeding back the output of the block cypher encoder to the input of the block cypher encoder, (b) inputing the key to the block cypher encoder and identifying a current seed as the initial first seed, (c) initializing a bit pointer to point to the least significant bit of the function input, (d) inputing the current seed to the block cypher encoder and generating an output stream of length 2 n bits in correspondence to 2 n inner products between the 2 n successive inputs of the block cypher encoder and the second seed, (e) if the bit pointer does not point to the most significant bit, continuing with step (f); otherwise, proceeding to step (h), (f) if the bit in the function input pointed at by the bit pointer is a first bit value, selecting the first n bits of the output stream as the current seed to the block cypher encoder, incrementing the bit pointer, and returning to step (d), (g) if the bit in the function input pointed at by the bit pointer is a second bit value, selecting the last n bits of the output stream as the current seed to the block cypher encoder, incrementing the bit pointer, and returning to step (d), (h) if the most significant bit in the function input is a first bit value, selecting the first n bits of the output stream as the function value, or (i) if the most significant bit in the function input is a second bit value, selecting the last n bits of the output stream as the function value.
Claim 26
Independent Claim
317 words
A method for generating a cryptographically strong pseudo-random function wherein a function index is composed of first and second seeds each of length n and a key for a block cypher encoder, wherein the input to the function is composed of an m bit string, the method comprising the steps of (a) feeding back the output of the block cypher encoder to the input of the block cypher encoder, (b) inputing the key to the block cypher encoder and identifying a current seed as the initial first seed, (c) initializing a bit pointer to point to the least significant bit of the function input, (d) inputing the current seed to the block cypher encoder and generating an output stream of length 2 n bits in correspondence to 2 n inner products between the 2 n successive inputs of the block cypher encoder and the second seed, (e) if the bit pointer does not point to the most significant bit, continuing with step (f); otherwise, proceeding to step (h), (f) if the bit in the function input pointed at by the bit pointer is a first bit value, selecting the first n bits of the output stream as the current seed to the block cypher encoder, incrementing the bit pointer, and returning to step (d), (g) if the bit in the function input pointed at by the bit pointer is a second bit value, selecting the last n bits of the output stream as the current seed to the block cypher encoder, incrementing the bit pointer, and returning to step (d), (h) if the most significant bit in the function input is a first bit value, selecting the first n bits of the output stream as the function value, or (i) if the most significant bit in the function input is a second bit value, selecting the last n bits of the output stream as the function value.
Claim 27
Dependent Claim
124 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing first and second seeds of the same length, the circuitry comprising a block cypher encoder having a fixed random encoder key, means, coupled to the input to said block cypher encoder, for inputing the first seed as the first input to said block cypher encoder, means, coupled to the input of said said block cypher encoder, for generating an output bit in the stream in correspondence to an inner product between the input of said block cypher encoder and the second seed, and means, coupled to the input and output of said block cypher encoder, for feeding back the output of said block cypher encoder to the input of the block cypher encoder.
Claim 28
Dependent Claim
124 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing first and second seeds of the same length, the circuitry comprising a block cypher encoder having a fixed random encoder key, means, coupled to the input to said block cypher encoder, for inputing the first seed as the first input to said block cypher encoder, means, coupled to the input of said said block cypher encoder, for generating an output bit in the stream in correspondence to an inner product between the input of said block cypher encoder and the second seed, and means, coupled to the input and output of said block cypher encoder, for feeding back the output of said block cypher encoder to the input of the block cypher encoder.
Claim 29
Dependent Claim
70 words
The circuitry as recited in claim 18 wherein means for generating said output bit includes means, coupled to the input of said block cypher encoder, for bitwise ANDing the input of said block cypher encoder and the second seed, and means, coupled to said means for bitwise ANDing, for determining the parity of the output of said means for bitwise ANDing and for outputting said parity as said output bit.
Claim 30
Dependent Claim
128 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing a first seed and S second seeds all of the same length, the circuitry comprising a block cypher encoder having a fixed random encoder key, means, coupled to the input of said block cypher encoder, for inputing the first seed as the first input to said block cypher encoder, means, coupled to the input of said block cypher encoder, for generating S output bits in the stream in correspondence to S inner products between the input of said block cypher encoder and the S second seeds, and means, coupled to the input and output of said block cypher encoder, for feeding back the output of said block cypher encoder to the input of said block cypher encoder.
Claim 31
Dependent Claim
128 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing a first seed and S second seeds all of the same length, the circuitry comprising a block cypher encoder having a fixed random encoder key, means, coupled to the input of said block cypher encoder, for inputing the first seed as the first input to said block cypher encoder, means, coupled to the input of said block cypher encoder, for generating S output bits in the stream in correspondence to S inner products between the input of said block cypher encoder and the S second seeds, and means, coupled to the input and output of said block cypher encoder, for feeding back the output of said block cypher encoder to the input of said block cypher encoder.
Claim 32
Dependent Claim
82 words
The circuitry as recited in claim 20 wherein said means for generating said S output bits includes means, coupled to the input of said block cypher encoder, for bitwise ANDing the input of the block cypher encoder and a corresponding one of the S second seeds, and means, coupled to said means for bitwise ANDing, for determining the parity of the output of said means for bitwise ANDing and for outputting said parity as the corresponding one of said S output bits.
Claim 33
Dependent Claim
155 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits in groups of NS utilizing N first and NS second seeds, all of the same length, the circuitry comprising N block cypher encoders wherein each of the encoders has a different fixed random key, means, coupled to the inputs of said N block cypher encoders, for inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, means, coupled to the inputs of each of said N block cypher encoders, for concurrently generating the output bits I,J, J=1, 2, . . . , S, in each group of NS bits in correspondence to an inner product between the input to each encoder I and the corresponding second seed I,J, and means, coupled to the input and output of each of said encoders, for feeding back the output of each encoder I as its next input.
Claim 34
Dependent Claim
155 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits in groups of NS utilizing N first and NS second seeds, all of the same length, the circuitry comprising N block cypher encoders wherein each of the encoders has a different fixed random key, means, coupled to the inputs of said N block cypher encoders, for inputing the first seed I, I=1, 2, . . . , N, as the first input to the corresponding encoder I, means, coupled to the inputs of each of said N block cypher encoders, for concurrently generating the output bits I,J, J=1, 2, . . . , S, in each group of NS bits in correspondence to an inner product between the input to each encoder I and the corresponding second seed I,J, and means, coupled to the input and output of each of said encoders, for feeding back the output of each encoder I as its next input.
Claim 35
Dependent Claim
82 words
The circuitry as recited in claim 22 said means for generating said output bits I,J, J=1, 2, . . . , S includes means, coupled to the input of said encoders, for bitwise ANDing the input of the encoder I and the second seed I,J, J=1, 2, . . . , S, and means, coupled to said means for bitwise ANDing, for outputting the parity of the bitwise ANDing means as the output bits I,J, J=1, 2, . . . , S.
Claim 36
Dependent Claim
138 words
Circuitry for generating stream of cryptographically strong pseudo-random bits utilizing first and second seeds of the same length, the circuitry comprising two block cypher encoders wherein the fixed random encoder key is different for each of the encoders, means, coupled to the two encoders, for interconnecting the two encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the first encoder, for inputing the first seed as the first input of the first encoder, means, coupled to the first encoder, for generating an output bit in the stream in correspondence to an inner product between the input of the first encoder and the second seed, and means, coupled to said encoders, for feeding back the output of the second encoder as the subsequent input the the first encoder.
Claim 37
Dependent Claim
138 words
Circuitry for generating stream of cryptographically strong pseudo-random bits utilizing first and second seeds of the same length, the circuitry comprising two block cypher encoders wherein the fixed random encoder key is different for each of the encoders, means, coupled to the two encoders, for interconnecting the two encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the first encoder, for inputing the first seed as the first input of the first encoder, means, coupled to the first encoder, for generating an output bit in the stream in correspondence to an inner product between the input of the first encoder and the second seed, and means, coupled to said encoders, for feeding back the output of the second encoder as the subsequent input the the first encoder.
Claim 38
Dependent Claim
68 words
The circuitry as recited in claim 24 wherein means for generating said output bit includes means, coupled to the input of the first encoder, for bitwise ANDing the input of the first encoder and the second seed, and means, coupled to said means for bitwise ANDing, for determining the parity of the output of said means for bitwise ANDing and for outputting said parity as said output bit.
Claim 39
Dependent Claim
144 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing a first seed and S second seeds all of the same length, the circuitry comprising two block cypher encoders wherein the fixed random encoder key is different for each of the encoders, means, coupled to the two encoders, for interconnecting the two encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the first encoder, for inputing the first seed as the first input of the first encoder, means, coupled to the first encoder, for generating S output bits in the stream in correspondence to S inner products between the input of the first encoder and the S second seeds, and means, coupled to said encoders, for feeding back the output of the second encoder as the subsequent input the the first encoder.
Claim 40
Dependent Claim
144 words
Circuitry for generating a stream of cryptographically strong pseudo-random bits utilizing a first seed and S second seeds all of the same length, the circuitry comprising two block cypher encoders wherein the fixed random encoder key is different for each of the encoders, means, coupled to the two encoders, for interconnecting the two encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the first encoder, for inputing the first seed as the first input of the first encoder, means, coupled to the first encoder, for generating S output bits in the stream in correspondence to S inner products between the input of the first encoder and the S second seeds, and means, coupled to said encoders, for feeding back the output of the second encoder as the subsequent input the the first encoder.
Claim 41
Dependent Claim
79 words
The circuitry as recited in claim 26 wherein said means for of generating said S output bits includes means, coupled to the first encoder, for bitwise ANDing the input of the first encoder and a corresponding one of the S second seeds, and means, coupled to said means for bitwise ANDing, for determining the parity resulting from each corresponding bitwise ANDing and for outputting the parity of each bitwise ANDing as the corresponding one of said S output bits.
Claim 42
Dependent Claim
201 words
Circuitry for generating stream of cryptographically strong pseudo-random bits in sets of N utilizing N first seeds and N second seeds all of the same length, the circuitry comprising a plurality N of two-block cypher encoders wherein for each of the two-block encoders the fixed random encoder key is different for each of the encoders in the two-block encoders, means, coupled to the N two-block encoders, for interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the N two-block encoders, for inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, means, coupled to the input of the first encoder of each encoder I, for concurrently generating the output bit I in each of the sets in correspondence to an inner product between the input to the two-block encoder I and the corresponding second seed I, and means, coupled to each two-block encoder I, for feeding back the output of the second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I.
Claim 43
Dependent Claim
201 words
Circuitry for generating stream of cryptographically strong pseudo-random bits in sets of N utilizing N first seeds and N second seeds all of the same length, the circuitry comprising a plurality N of two-block cypher encoders wherein for each of the two-block encoders the fixed random encoder key is different for each of the encoders in the two-block encoders, means, coupled to the N two-block encoders, for interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the N two-block encoders, for inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, means, coupled to the input of the first encoder of each encoder I, for concurrently generating the output bit I in each of the sets in correspondence to an inner product between the input to the two-block encoder I and the corresponding second seed I, and means, coupled to each two-block encoder I, for feeding back the output of the second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I.
Claim 44
Dependent Claim
70 words
The circuitry as recited in claim 28 wherein means for generating the output bit I includes means, coupled to the first encoder of each two-block encoder I, for bitwise ANDing the input to the first encoder of the two-block encoder I and the corresponding second seed I, and means, coupled to said means for bitwise ANDING, for outputting the parity of the bitwise ANDing means as the output bit I.
Claim 45
Dependent Claim
214 words
Circuitry for generating stream of cryptographically strong pseudo-random bits in sets of NS utilizing N first seeds and NS second seeds all of the same length, the circuitry comprising a plurality N of two-block cypher encoders wherein for each of the two-block encoders the fixed random encoder key is different for each of the encoders in the two-block encoders, means, coupled to the N two-block encoders, for interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the N two-block encoders, for inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, means, coupled to the input of the first encoder of each encoder I, for concurrently generating the output bits I,J, J=1,2, . . . , S, in each of the sets of NS bits in correspondence to an inner product between the input to the first encoder of the two-block encoder I and the corresponding second seed I,J and means, coupled to each two-block encoder I, for feeding back the output of each second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I.
Claim 46
Dependent Claim
214 words
Circuitry for generating stream of cryptographically strong pseudo-random bits in sets of NS utilizing N first seeds and NS second seeds all of the same length, the circuitry comprising a plurality N of two-block cypher encoders wherein for each of the two-block encoders the fixed random encoder key is different for each of the encoders in the two-block encoders, means, coupled to the N two-block encoders, for interconnecting each of the two-block encoders such that the output of the first encoder serves as the input of the second encoder, means, coupled to the N two-block encoders, for inputing the first seed I, I=1,2, . . . , N as the first input to the corresponding first encoder of two-block encoder I, means, coupled to the input of the first encoder of each encoder I, for concurrently generating the output bits I,J, J=1,2, . . . , S, in each of the sets of NS bits in correspondence to an inner product between the input to the first encoder of the two-block encoder I and the corresponding second seed I,J and means, coupled to each two-block encoder I, for feeding back the output of each second encoder of each two-block encoder I as the next input to the first encoder of each two-block encoder I.
Claim 47
Dependent Claim
91 words
The circuitry as recited in claim 30 wherein said means for generating said output bits I,J, J=1, 2, . . . , S includes means, coupled to the first encoder of each two-block encoder I, for bitwise ANDing the input to the first encoder of each two-block encoder I and the second seed I,J, J=1, 2, . . . , S, and means, coupled to said means for bitwise ANDing, for outputting the parity of the bitwise ANDing means as the output bits I,J, J=1, 2, . . . , S.
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) | 1998-05-29 | 1998-11-28 | 1999-05-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-29 | 2002-11-28 | 2003-05-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-29 | 2006-11-28 | 2007-05-30 | $7700.00 | Window Closed / Lapsed |