The following pages link to Gora Adj (Q1616165):
Displaying 6 items.
- Smoothness test for polynomials defined over small characteristic finite fields (Q1616168) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- On isogeny graphs of supersingular elliptic curves over finite fields (Q1633305) (← links)
- On the cost of computing isogenies between supersingular elliptic curves (Q1726684) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma (Q2949468) (← links)
