A p + 1 Method of Factoring
From MaRDI portal
Cited in
(29)- Applications to cryptography of twisting commutative algebraic groups
- Modern factorization methods
- Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Strong pseudoprimes to base 2
- Modular curves over number fields and ECM
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
- New weak keys in RSA
- Revisiting Wiener’s Attack – New Weak Keys in RSA
- A deterministic version of Pollard's p-1 algorithm
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Tables of Fibonacci and Lucas factorizations
- Factoring with Cyclotomic Polynomials
- ’n Faktoriseringsmetode gegrond op ’n additiewe eienskap
- Finding Suitable Curves for the Elliptic Curve Method of Factorization
- A cubic analogue of the RSA cryptosystem
- Factoring Numbers with Conway’s 150 Method
- Computing isomorphisms and embeddings of finite fields
- An overview of factoring
- Improved Stage 2 to P ± 1 Factoring Algorithms
- Computing prime divisors in an interval
- Factoring integers and oracles for elliptic and hyperelliptic curves
- Prime factorization using square root approximation
- (Verifiable) delay functions from Lucas sequences
- Elliptic-curve factoring, witnesses and oracles
- Factoring on a computer
- Optimal strong primes
This page was built for publication: A p + 1 Method of Factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953831)
