scientific article; zbMATH DE number 3801619
From MaRDI portal
Publication:4745878
zbMATH Open0508.10004MaRDI QIDQ4745878FDOQ4745878
Authors: Carl Pomerance
Publication date: 1982
Title of this publication is not available (Why is that?)
Cited In (29)
- New ideas for factoring large integers
- Factoring on a computer
- Linear and sublinear time algorithms for the basis of abelian groups
- Factorization using the quadratic sieve algorithm
- Factoring with Two Large Primes
- Fast norm computation in smooth-degree abelian number fields
- Implications of the arithmetic ratio of prime numbers for RSA security
- Higher-dimensional sieving for the number field sieve algorithms
- A quantum version of Pollard's Rho of which Shor's algorithm is a particular case
- The sharp threshold for making squares
- Quadratic sieving
- Factoring with hints
- Approximating rings of integers in number fields
- Faster individual discrete logarithms in finite fields of composite extension degree
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- A Practical Analysis of the Elliptic Curve Factoring Algorithm
- Rigorous analysis of a randomised number field sieve
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Smooth values of quadratic polynomials
- The Factorization of the Ninth Fermat Number
- Some uses of microcomputers in number theory research
- CryptAttackTester: high-assurance attack analysis
- Smooth subsum search a heuristic for practical integer factorization
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Factoring with the quadratic sieve on large vector computers
- Indiscreet logarithms in finite fields of small characteristic
- New applications of the polynomial method: the cap set conjecture and beyond
- On the distribution in short intervals of integers having no large prime factor
- A Kilobit Hidden SNFS Discrete Logarithm Computation
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 Q4745878)