Smallest Reduction Matrix of Binary Quadratic Forms
From MaRDI portal
Recommendations
Cites work
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- Binary quadratic forms. An algorithmic approach
- Binary quadratic forms. Classical theory and modern computations
- Factoring N=p^rq for large r
- Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 5763317 (Why is no real title available?)
- scientific article; zbMATH DE number 3522065 (Why is no real title available?)
- scientific article; zbMATH DE number 1516550 (Why is no real title available?)
- scientific article; zbMATH DE number 784878 (Why is no real title available?)
- Low-dimensional lattice basis reduction revisited
- NICE -- New Ideal Coset Encryption
- On some problems of the arithmetical theory of continued fractions
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Some results concerning certain periodic continued fractions
- Using LLL-reduction for solving RSA and factorization problems
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
Cited in
(3)
This page was built for publication: Smallest Reduction Matrix of Binary Quadratic Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931639)