An Overview of Factoring
From MaRDI portal
Publication:5019319
DOI10.1007/978-1-4684-4730-9_6zbMath1486.11157OpenAlexW1599730062MaRDI QIDQ5019319
No author found.
Publication date: 8 January 2022
Published in: Advances in Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4684-4730-9_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On distinguishing prime numbers from composite numbers
- Recent developments in primality testing
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Factorization and Primality Tests
- The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
- A Monte Carlo Factoring Algorithm With Linear Storage
- Some remarks concerning the M.I.T. public-key cryptosystem
- The Pseudoprimes to 25 ⋅10 9
- A modification of the RSA public-key encryption procedure (Corresp.)
- Factorization of the Eighth Fermat Number
- A p + 1 Method of Factoring
- A Method of Factoring and the Factorization of F 7
- A monte carlo method for factorization
- A method for obtaining digital signatures and public-key cryptosystems
- A design for a number theory package with an optimized trial division routine
- A New Factorization Technique Using Quadratic Forms
- Factoring Large Integers
- Some Factorizations of 2 n ± 1 and Related Results
This page was built for publication: An Overview of Factoring