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: Lenstra elliptic-curve factorization method | Statement: [Hendrik Lenstra, knownFor, Lenstra elliptic-curve factorization method]

Target entity: Lenstra elliptic-curve factorization method
Context triple: [Hendrik Lenstra, knownFor, Lenstra elliptic-curve factorization method]

• 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. 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.
• C. Schoof–Elkies–Atkin (SEA) point-counting algorithm
  The Schoof–Elkies–Atkin (SEA) point-counting algorithm is an efficient method in computational number theory and elliptic curve cryptography for determining the number of points on an elliptic curve over a finite field.
• D. 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.
• E. 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.
• 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: Lenstra elliptic-curve factorization method
Triple: [Hendrik Lenstra, knownFor, Lenstra elliptic-curve factorization method]

The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.

Target entity: Lenstra elliptic-curve factorization method
Target entity description: The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.

• 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. 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.
• C. Schoof–Elkies–Atkin (SEA) point-counting algorithm
  The Schoof–Elkies–Atkin (SEA) point-counting algorithm is an efficient method in computational number theory and elliptic curve cryptography for determining the number of points on an elliptic curve over a finite field.
• D. 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.
• E. 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.
• F. None of above. chosen