Pages that link to "Item:Q3320493"
From MaRDI portal
The following pages link to Computing Logarithms in Finite Fields of Characteristic Two (Q3320493):
Displaying 16 items.
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms (Q1803561) (← links)
- Complexity of a determinate algorithm for the discrete logarithm (Q1898267) (← links)
- Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Computation of low-weight parity checks for correlation attacks on stream ciphers (Q4608500) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
