The following pages link to (Q4063214):
Displaying 38 items.
- Elliptic curve analogues of a pseudorandom generator (Q452828) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- A multiprecise integer arithmetic package (Q547494) (← links)
- The square root Diffie-Hellman problem (Q663482) (← links)
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem (Q683912) (← links)
- Efficient verification of Tunnell's criterion (Q957686) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) (Q1633281) (← links)
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) (Q1647353) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 (Q1826275) (← links)
- Counting points on elliptic curves over finite fields (Q1909875) (← links)
- A refinement of Müller's cube root algorithm (Q1994923) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead (Q2149801) (← links)
- Rédei permutations with cycles of the same length (Q2211337) (← links)
- On computing the degree of a Chebyshev polynomial from its value (Q2229707) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- Computation of Iwasawa lambda invariants for imaginary quadratic fields (Q2641348) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields (Q3452558) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Computing elliptic curves over $\mathbb {Q}$ (Q4612572) (← links)
- IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM (Q4968635) (← links)
- (Q5087790) (← links)
- (Q5118842) (← links)
- The South Caicos Factoring Algorithm (Q5148802) (← links)
- (Q6039849) (← links)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458) (← links)
- (Q6176155) (← 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)
