The following pages link to (Q3615926):
Displaying 22 items.
- Point counting in families of hyperelliptic curves (Q937277) (← links)
- On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
- Primality testing with Gaussian periods (Q1737980) (← links)
- Linear differential equations as a data structure (Q2329042) (← links)
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (Q2351480) (← links)
- Counting points on hyperelliptic curves in average polynomial time (Q2445320) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- Computing Igusa class polynomials (Q2862530) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Faster algorithms for the square root and reciprocal of power series (Q3081289) (← links)
- Wild McEliece (Q3084251) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- A search for Wilson primes (Q3189466) (← links)
- Bad Directions in Cryptographic Hash Functions (Q3194624) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Short addition sequences for theta functions (Q4637128) (← links)
- ECM using Edwards curves (Q4912021) (← links)
- (Q5150372) (← links)
- (Q5150442) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
