scientific article; zbMATH DE number 3341170
From MaRDI portal
Publication:5617656
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization (11Y05) Primality (11Y11) Computer solution of Diophantine equations (11Y50) Continued fraction calculations (number-theoretic aspects) (11Y65)
Recommendations
Cited in
(33)- Tables of good lattices in four and five dimensions
- Uniform complexity and digital signatures
- Some remarks on the security of the identification scheme based on permuted kernels
- Recent developments in primality proving
- Taking cube roots in \(\mathbb Z_{m}\)
- A refinement of Müller's cube root algorithm
- On the functional equation \(x+f(y+f(x))=y+f(x+f(y))\). II
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- On the Cipolla-Lehmer type algorithms in finite fields
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Efficient Finite Fields in the Maxima Computer Algebra System
- scientific article; zbMATH DE number 3899009 (Why is no real title available?)
- Some remarks concerning the M.I.T. public-key cryptosystem
- A New Algorithm for Factoring Polynomials Over Finite Fields
- scientific article; zbMATH DE number 3475515 (Why is no real title available?)
- A Search for Large Twin Prime Pairs
- A design for a number theory package with an optimized trial division routine
- scientific article; zbMATH DE number 4000014 (Why is no real title available?)
- A New Factorization Technique Using Quadratic Forms
- On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem
- Improving the Pocklington and Padró-Sáez cube root algorithm
- Trace expression of \(r\)-th root over finite field
- On the use of computer technology in the study of the discipline «Numbers theory»
- A multiprecise integer arithmetic package
- Note on Representing a Prime as a Sum of Two Squares
- scientific article; zbMATH DE number 7688194 (Why is no real title available?)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- On the computation of r-th roots in finite fields
- Finding orientations of supersingular elliptic curves and quaternion orders
- Point (de)compression for elliptic curves over highly 2-adic finite fields
- Computing the Ramanujan tau function
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5617656)
