Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: linear feedback shift register | Statement: [Berlekamp–Massey algorithm, relatedTo, linear feedback shift register]

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.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: linear feedback shift register
Triple: [Berlekamp–Massey algorithm, relatedTo, linear feedback shift register]

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.

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