On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (Q5382575): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127985122, #quickstatements; #temporary_batch_1723488958199
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1706.08447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Function Field Sieve and the Impact of Higher Splitting Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the discrete logarithm problem in finite fields of fixed characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Covers and Bijections on Rational Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of a Chebotarev density theorem for function fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Function Fields and Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847338 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127985122 / rank
 
Normal rank

Latest revision as of 21:15, 12 August 2024

scientific article; zbMATH DE number 7067259
Language Label Description Also known as
English
On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
scientific article; zbMATH DE number 7067259

    Statements

    On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (English)
    0 references
    0 references
    18 June 2019
    0 references
    finite fields
    0 references
    global function fields
    0 references
    cryptography
    0 references
    irreducible polynomials
    0 references
    Galois theory
    0 references
    DLP
    0 references

    Identifiers