scientific article
From MaRDI portal
Publication:4063214
zbMath0307.10015MaRDI QIDQ4063214
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Radix representation; digital problems (11A63) Software, source code, etc. for problems pertaining to number theory (11-04) Algebraic numbers; rings of algebraic integers (11R04) Tables in numerical analysis (65A05)
Related Items (37)
Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) ⋮ On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ On the Cipolla-Lehmer type algorithms in finite fields ⋮ When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) ⋮ Computation of Iwasawa lambda invariants for imaginary quadratic fields ⋮ Counting points on elliptic curves over finite fields ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Univariate polynomial factorization over finite fields ⋮ Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm ⋮ IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM ⋮ Uniform complexity and digital signatures ⋮ Efficient Finite Fields in the Maxima Computer Algebra System ⋮ Unnamed Item ⋮ Computing elliptic curves over $\mathbb {Q}$ ⋮ Rédei permutations with cycles of the same length ⋮ Elliptic curve analogues of a pseudorandom generator ⋮ Unnamed Item ⋮ The square root Diffie-Hellman problem ⋮ On computing the degree of a Chebyshev polynomial from its value ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ Solving systems of diagonal polynomial equations over finite fields ⋮ The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem ⋮ A refinement of Müller's cube root algorithm ⋮ Efficient verification of Tunnell's criterion ⋮ Computing in degree \(2^k\)-extensions of finite fields of odd characteristic ⋮ A multiprecise integer arithmetic package ⋮ Unnamed Item ⋮ Realistic analysis of some randomized algorithms ⋮ Unnamed Item ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ The South Caicos Factoring Algorithm ⋮ Deterministic irreducibility testing of polynomials over large finite fields ⋮ Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields
This page was built for publication:
