Pages that link to "Item:Q2874534"

The following pages link to Breaking ‘128-bit Secure’ Supersingular Binary Curves (Q2874534):

Displaying 25 items.

• Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) (Q324277) (← 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)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Almost perfect nonlinear trinomials and hexanomials (Q2011496) (← 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)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
• Structure-preserving public-key encryption with leakage-resilient CCA security (Q2330095) (← links)
• Still wrong use of pairings in cryptography (Q2335138) (← 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)
• Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)
• On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← 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)
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts (Q5738790) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Roots of certain polynomials over finite fields (Q6166735) (← links)