Pages that link to "Item:Q3691838"
From MaRDI portal
The following pages link to A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex> (Q3691838):
Displaying 14 items.
- Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
- On the security of the Lucas function (Q673987) (← links)
- Complete addition formulas on the level four theta model of elliptic curves (Q780585) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\) (Q1903546) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Computing Logarithms in Finite Fields of Characteristic Two (Q3320493) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Elliptic divisibility sequences over the Edwards model of elliptic curves (Q5059565) (← links)
