A linear space algorithm for computing the hermite normal form

DOI10.1145/384101.384133zbMath1356.68288OpenAlexW2037483935MaRDI QIDQ2958938

Bogdan Warinschi, Daniele Micciancio

Publication date: 3 February 2017

Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/384101.384133

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)

Related Items (15)

On random nonsingular Hermite normal form ⋮ A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Unnamed Item ⋮ On the impossibility of purely algebraic signatures ⋮ Natural density distribution of Hermite normal forms of integer matrices ⋮ A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)] ⋮ Storage efficient algorithm for Hermite normal form using LLL ⋮ Generating shorter bases for hard random lattices ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Fast computation of Hermite normal forms of random integer matrices ⋮ A Digital Signature Scheme Based on CVP  ∞ ⋮ Bijectivity Certification of 3D Digitized Rotations ⋮ Attacks on Secure Logging Schemes

This page was built for publication: A linear space algorithm for computing the hermite normal form