On factorisation, with a suggested new approach

DOI10.1090/S0025-5718-1975-0366796-6zbMath1263.11114MaRDI QIDQ4924581

J. C. P. Miller

Publication date: 7 June 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

extension of the Fermat-Lucas-Lehmer Theoremstesting primality of large integers

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05) Primality (11Y11)

Related Items

On the distribution in short intervals of integers having no large prime factor ⋮ Fast verification, testing, and generation of large primes ⋮ Which new RSA-signatures can be computed from certain given RSA- signatures! ⋮ Factoring 111 ... 11 — A stimulating problem ⋮ A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)

Cites Work

• Unnamed Item
• Unnamed Item
• On Integers all of whose Prime Factors are Small†
• Some new factorizations of 2ⁿ±1
• Some Factorizations of 2 n ± 1 and Related Results
• On the Converse of Fermat's Theorem
• A factorization theorem applied to a test for primality