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: Cantor–Zassenhaus algorithm | Statement: [Berlekamp’s algorithm for factoring polynomials over finite fields, influenced, Cantor–Zassenhaus algorithm]

Target entity: Cantor–Zassenhaus algorithm
Context triple: [Berlekamp’s algorithm for factoring polynomials over finite fields, influenced, Cantor–Zassenhaus algorithm]

• A. Berlekamp’s algorithm for factoring polynomials over finite fields
  Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. 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.
• D. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• E. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• 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: Cantor–Zassenhaus algorithm
Triple: [Berlekamp’s algorithm for factoring polynomials over finite fields, influenced, Cantor–Zassenhaus algorithm]

The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.

Target entity: Cantor–Zassenhaus algorithm
Target entity description: The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.

• A. Berlekamp’s algorithm for factoring polynomials over finite fields
  Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. 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.
• D. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• E. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• F. None of above. chosen