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