Pages that link to "Item:Q2938855"

The following pages link to Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms (Q2938855):

Displaying 16 items.

• 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)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← 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)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms (Q5380102) (← links)
• Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)
• MPC in the head using the subfield bilinear collision problem (Q6648188) (← links)