Fast square-free decomposition of integers using class groups
From MaRDI portal
Publication:6653363
DOI10.1007/S40993-024-00585-8MaRDI QIDQ6653363FDOQ6653363
Authors: Erik Mulder 
Publication date: 16 December 2024
Published in: Research in Number Theory (Search for Journal in Brave)
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Factoring integers with elliptic curves
- The difference between consecutive primes. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using LLL-reduction for solving RSA and factorization problems
- The development of the number field sieve
- Title not available (Why is that?)
- On the order of magnitude of the difference between consecutive prime numbers
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Approximating rings of integers in number fields
- A Monte Carlo Factoring Algorithm With Linear Storage
- Title not available (Why is that?)
- Detecting squarefree numbers
- A Rigorous Time Bound for Factoring Integers
- Title not available (Why is that?)
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- Factoring $$N=p^rq^s$$ for Large r and s
- A fast signature scheme based on congruential polynomial operations
- A new Rabin-type trapdoor permutation equivalent to factoring
- A deterministic algorithm for finding \(r\)-power divisors
- Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
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)
