A p + 1 Method of Factoring
From MaRDI portal
Publication:3953831
DOI10.2307/2007633zbMath0492.10004OpenAlexW4243764471WikidataQ57568157 ScholiaQ57568157MaRDI QIDQ3953831
Publication date: 1982
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2007633
Related Items (25)
Modern factorization methods ⋮ New weak keys in RSA ⋮ Optimal strong primes ⋮ An efficient probabilistic public-key cryptosystem over quadratic fields quotients ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Tables of Fibonacci and Lucas factorizations ⋮ Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ Prime factorization using square root approximation ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ Improved Stage 2 to P ± 1 Factoring Algorithms ⋮ Finding Suitable Curves for the Elliptic Curve Method of Factorization ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Applications to cryptography of twisting commutative algebraic groups ⋮ 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 ⋮ A cubic analogue of the RSA cryptosystem ⋮ Computing prime divisors in an interval ⋮ Factoring with Cyclotomic Polynomials ⋮ Strong pseudoprimes to base 2 ⋮ Modular curves over number fields and ECM ⋮ Factoring on a computer ⋮ An Overview of Factoring
This page was built for publication: A p + 1 Method of Factoring
