Fast square-free decomposition of integers using class groups

DOI10.1007/S40993-024-00585-8MaRDI QIDQ6653363zbMATH OpenFDO

Authors Erik Mulder

Publication date 16 December 2024

Published in Research in Number Theory (Search for Journal in Brave)

zbMATH Keywords

integer factorizationbinary quadratic formsclass groupssquare-free decomposition

Mathematics Subject Classification ID

Number theory (11-XX)

Recommendations

• Square form factorization, II
• Factorization of Square-Free Integers with High Bits Known
• Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
• scientific article; zbMATH DE number 5192057
• A Rigorous Time Bound for Factoring Integers

Cites work

• scientific article; zbMATH DE number 3785035 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 1273650 (Why is no real title available?)
• scientific article; zbMATH DE number 1302856 (Why is no real title available?)
• scientific article; zbMATH DE number 1303131 (Why is no real title available?)
• scientific article; zbMATH DE number 195204 (Why is no real title available?)
• scientific article; zbMATH DE number 6164023 (Why is no real title available?)
• scientific article; zbMATH DE number 1418303 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• A Monte Carlo Factoring Algorithm With Linear Storage
• A Rigorous Time Bound for Factoring Integers
• A deterministic algorithm for finding \(r\)-power divisors
• A fast signature scheme based on congruential polynomial operations
• A new Rabin-type trapdoor permutation equivalent to factoring
• A new public-key cryptosystem over a quadratic order with quadratic decryption time.
• Approximating rings of integers in number fields
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Detecting squarefree numbers
• Factoring $$N=p^rq^s$$ for Large r and s
• Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
• Factoring integers with elliptic curves
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• On the order of magnitude of the difference between consecutive prime numbers
• The Magma algebra system. I: The user language
• The development of the number field sieve
• The difference between consecutive primes. II
• Using LLL-reduction for solving RSA and factorization problems

This page was built for publication: Fast square-free decomposition of integers using class groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653363)