linear feedback shift register
E646779
A linear feedback shift register is a sequential digital circuit that generates deterministic pseudorandom bit sequences by shifting bits and feeding back a linear function of its previous state.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Fibonacci LFSR | 1 |
| Galois LFSR | 1 |
| linear feedback shift register canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7174340 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: linear feedback shift register Context triple: [Berlekamp–Massey algorithm, relatedTo, linear feedback shift register]
-
A.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
B.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
Feistel network
A Feistel network is a symmetric structure for building block ciphers that splits data into halves and repeatedly applies round functions to achieve secure encryption and decryption.
-
E.
Substitution–permutation network
A substitution–permutation network is a symmetric-key cryptographic design that secures data by repeatedly applying nonlinear substitutions and bitwise permutations to achieve confusion and diffusion.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: linear feedback shift register Target entity description: A linear feedback shift register is a sequential digital circuit that generates deterministic pseudorandom bit sequences by shifting bits and feeding back a linear function of its previous state.
-
A.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
B.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
Feistel network
A Feistel network is a symmetric structure for building block ciphers that splits data into halves and repeatedly applies round functions to achieve secure encryption and decryption.
-
E.
Substitution–permutation network
A substitution–permutation network is a symmetric-key cryptographic design that secures data by repeatedly applying nonlinear substitutions and bitwise permutations to achieve confusion and diffusion.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
finite-state machine
ⓘ
pseudorandom sequence generator ⓘ sequential digital circuit ⓘ shift register ⓘ |
| advantage |
high-speed operation
ⓘ
low hardware complexity ⓘ |
| basedOn | recurrence relation over GF(2) ⓘ |
| cannotGenerate | all-zero state in maximum-length configuration ⓘ |
| characterizedBy |
feedback polynomial
ⓘ
register length ⓘ tap positions ⓘ |
| clockedBy | discrete time steps ⓘ |
| hasComponent |
clock input
ⓘ
feedback network ⓘ feedback taps ⓘ output bit line ⓘ series of storage elements ⓘ |
| hasProperty |
bit-oriented
ⓘ
deterministic ⓘ linear over GF(2) ⓘ maximum-length sequence possible when feedback polynomial is primitive ⓘ periodic sequence ⓘ pseudorandom output ⓘ |
| hasType |
Fibonacci LFSR
ⓘ
linked to:
linear feedback shift register
Galois LFSR ⓘ
linked to:
linear feedback shift register
external XOR LFSR ⓘ internal XOR LFSR ⓘ |
| input | initial seed value ⓘ |
| limitation | linear structure vulnerable to cryptanalysis ⓘ |
| mathematicallyModeledAs | linear recurrence over GF(2) ⓘ |
| maximumPeriod | 2^n - 1 states for n-bit LFSR with primitive polynomial ⓘ |
| operatesOn | binary sequences ⓘ |
| output | pseudorandom bit stream ⓘ |
| relatedTo |
Gold codes
ⓘ
cyclic redundancy check ⓘ m-sequences ⓘ |
| stateSpace | 2^n possible states for n-bit register ⓘ |
| usedIn |
built-in self-test
ⓘ
cryptography ⓘ error correction coding ⓘ error detection ⓘ hardware random number generators ⓘ pseudo-noise sequence generation ⓘ scramblers ⓘ spread-spectrum communications ⓘ stream ciphers ⓘ |
| uses |
exclusive OR gates
ⓘ
flip-flops ⓘ linear feedback function ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: linear feedback shift register Description of subject: A linear feedback shift register is a sequential digital circuit that generates deterministic pseudorandom bit sequences by shifting bits and feeding back a linear function of its previous state.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: linear feedback shift register
linked to: linear feedback shift register