The following pages link to (Q5617656):
Displaying 30 items.
- A multiprecise integer arithmetic package (Q547494) (← links)
- Computing the Ramanujan tau function (Q850530) (← links)
- Tables of good lattices in four and five dimensions (Q1058809) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- Some remarks on the security of the identification scheme based on permuted kernels (Q1196463) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- Taking cube roots in \(\mathbb Z_{m}\) (Q1614110) (← links)
- A refinement of Müller's cube root algorithm (Q1994923) (← links)
- On the functional equation \(x+f(y+f(x))=y+f(x+f(y))\). II (Q2340864) (← links)
- New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- (Q3677829) (← links)
- Some remarks concerning the M.I.T. public-key cryptosystem (Q3852104) (← links)
- A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477) (← links)
- (Q4058712) (← links)
- A Search for Large Twin Prime Pairs (Q4175325) (← links)
- A New Factorization Technique Using Quadratic Forms (Q4771012) (← links)
- On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem (Q4777366) (← links)
- IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM (Q4968635) (← links)
- Trace expression of \(r\)-th root over finite field (Q5118842) (← links)
- On the use of computer technology in the study of the discipline «Numbers theory» (Q5155823) (← links)
- Note on Representing a Prime as a Sum of Two Squares (Q5675777) (← links)
- (Q6039849) (← links)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458) (← links)
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors (Q6148160) (← links)
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm (Q6192060) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
- Finding orientations of supersingular elliptic curves and quaternion orders (Q6632044) (← links)
