The following pages link to (Q4318705):
Displaying 7 items.
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Fast group operations on elliptic curves in Maple (Q1806495) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- (Q5150581) (← links)
