The following pages link to (Q4385516):
Displaying 26 items.
- On the ultimate complexity of factorials (Q703565) (← links)
- A strategy for elliptic curve primality proving (Q907001) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- From decomposable to residual theories (Q1045812) (← links)
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects (Q1267710) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- Elliptic periods and primality proving (Q1762314) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences (Q2437317) (← links)
- An efficient threshold RSA digital signature scheme (Q2485605) (← links)
- An efficient approach for secure multi-party computation without authenticated channel (Q2663510) (← links)
- Inversion of circulant matrices over \(\mathbf{Z}_m\) (Q2719071) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- Proving primality in essentially quartic random time (Q3420438) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- A Rigorous Subexponential Algorithm For Computation of Class Groups (Q3480172) (← links)
- A fast, rigorous technique for computing the regulator of a real quadratic field (Q3592698) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- Factoring with Two Large Primes (Q4317677) (← links)
- Quadratic class numbers and character sums (Q5470063) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
