Pages that link to "Item:Q2849389"

The following pages link to On the Function Field Sieve and the Impact of Higher Splitting Probabilities (Q2849389):

Displaying 31 items.

• Effective compression maps for torus-based cryptography (Q264119) (← links)
• Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) (Q324277) (← links)
• Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
• Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
• Index calculus in the trace zero variety (Q895005) (← links)
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
• Smoothness test for polynomials defined over small characteristic finite fields (Q1616168) (← links)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
• Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Solving \(X^{q+1}+X+a=0\) over finite fields (Q1995227) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Almost perfect nonlinear trinomials and hexanomials (Q2011496) (← links)
• Classification of fractional projective permutations over finite fields (Q2135562) (← links)
• New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
• Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\) (Q2238912) (← links)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
• A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
• Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
• Generating sets for the multiplicative groups of algebras over finite fields and expander graphs (Q2409015) (← links)
• A characterization of the number of roots of linearized and projective polynomials in the field of coefficients (Q2422155) (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
• Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH (Q2697676) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (Q5382575) (← links)
• Difference sets and three-weight linear codes from trinomials (Q6156905) (← links)
• A new perspective on the powers of two descent for discrete logarithms in finite fields (Q6165875) (← links)
• Roots of certain polynomials over finite fields (Q6166735) (← links)