Pages that link to "Item:Q5418686"

The following pages link to A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic (Q5418686):

Displaying 49 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)
• 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)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
• Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
• Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules (Q1800711) (← links)
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem (Q2191201) (← links)
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• Koblitz curves over quadratic fields (Q2318090) (← 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)
• Jacobian coordinates on genus 2 curves (Q2397457) (← links)
• Generating sets for the multiplicative groups of algebras over finite fields and expander graphs (Q2409015) (← links)
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression (Q2413618) (← 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)
• Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
• Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
• The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838) (← links)
• Computational Number Theory and Cryptography (Q2926150) (← links)
• Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
• Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)
• Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
• Collecting relations for the number field sieve in (Q2971019) (← links)
• On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• Field extensions and index calculus on algebraic curves (Q5346826) (← links)
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)