The following pages link to (Q4341740):
Displaying 15 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem (Q1611366) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- A research on new public-key encryption schemes (Q2572324) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Parameterized Splitting Systems for the Discrete Logarithm (Q5281511) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
