Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
From MaRDI portal
Publication:3928238
DOI10.1016/0196-6774(80)90021-8zbMath0473.68030OpenAlexW2025525128MaRDI QIDQ3928238
Publication date: 1980
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(80)90021-8
Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear Diophantine equations (11D09) Radix representation; digital problems (11A63)
Related Items
A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency ⋮ Algorithms to construct Minkowski reduced and Hermite reduced lattice bases ⋮ A hierarchy of polynomial time lattice basis reduction algorithms ⋮ InfoMod: a visual and computational approach to Gauss' binary quadratic forms ⋮ Dirichlet’s proof of the three-square theorem: An algorithmic perspective ⋮ A key-exchange system based on imaginary quadratic fields ⋮ Iterated ring class fields and the icosahedron ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ The optimal LLL algorithm is still polynomial in fixed dimension. ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ On the parametrization of solutions of quadratic equations ⋮ Density computations for real quadratic units ⋮ On the computation of quadratic 2-class groups ⋮ Smallest Reduction Matrix of Binary Quadratic Forms ⋮ A linear algorithm for integer programming in the plane ⋮ Selected Applications of LLL in Number Theory ⋮ A Rigorous Time Bound for Factoring Integers ⋮ How to pick a random integer matrix? (and other questions) ⋮ Identification and signatures based on NP-hard problems of indefinite quadratic forms ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security ⋮ Short vectors of planar lattices via continued fractions ⋮ An algorithm for finding a shortest vector in a two-dimensional modular lattice
