An overview of factoring
From MaRDI portal
Recommendations
Cites work
- A design for a number theory package with an optimized trial division routine
- A method for obtaining digital signatures and public-key cryptosystems
- A Method of Factoring and the Factorization of F 7
- A modification of the RSA public-key encryption procedure (Corresp.)
- A Monte Carlo Factoring Algorithm With Linear Storage
- A monte carlo method for factorization
- A New Factorization Technique Using Quadratic Forms
- A p + 1 Method of Factoring
- Factoring Large Integers
- Factorization and Primality Tests
- Factorization of the Eighth Fermat Number
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- scientific article; zbMATH DE number 3836162 (Why is no real title available?)
- scientific article; zbMATH DE number 3857198 (Why is no real title available?)
- scientific article; zbMATH DE number 4055702 (Why is no real title available?)
- scientific article; zbMATH DE number 3767743 (Why is no real title available?)
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 3528292 (Why is no real title available?)
- scientific article; zbMATH DE number 3630832 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- On distinguishing prime numbers from composite numbers
- Recent developments in primality testing
- Some Factorizations of 2 n ± 1 and Related Results
- Some remarks concerning the M.I.T. public-key cryptosystem
- The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
- The Pseudoprimes to 25 ⋅10 9
Cited in
(6)
This page was built for publication: An overview of factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019319)