A linear space algorithm for computing the hermite normal form

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Symposium on Symbolic and Algebraic Computation

• Publication date

  2001-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/384101.384133
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Modern computer algebra

  2002cited by this paper
• Improving Lattice Based Cryptosystems Using the Hermite Normal Form

  2001cited by this paper
• Lattice Based Cryptography: A Global Improvement

  1999cited by this paper
• Diophantine linear system solving

  1999influential reference
• Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography

  1999cited by this paper
• Computing Hermite and Smith normal forms of triangular integer matrices

  1998cited by this paper
• On the worst-case complexity of integer Gaussian elimination

  1997cited by this paper
• Public-Key Cryptosystems from Lattice Reduction Problems

  1996cited by this paper
• Computing Popov and Hermite forms of polynomial matrices

  1996cited by this paper
• Asymptotically fast computation of Hermite normal forms of integer matrices

  1996cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Asymptotically fast triangulation of matrices over rings

  1991cited by this paper
• An application of the Hermite normal form in integer programming

  1990cited by this paper
• Residual hermite normal form computations

  1989cited by this paper
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix

  1989cited by this paper
• A rigorous subexponential algorithm for computation of class groups

  1989cited by this paper
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic

  1987cited by this paper
• Fast parallel computation of hermite and smith forms of polynomial matrices

  1987cited by this paper
• Complexity questions in number theory

  1985cited by this paper
• Algorithms for the Solution of Systems of Linear Diophantine Equations

  1982cited by this paper
• Exact solution of linear equations usingP-adic expansions

  1982influential reference
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

  1979cited by this paper
• Polynomial Time Algorithms in the Theory of Linear Diophantine Equations

  1977cited by this paper
• Œuvres de Charles Hermite: Sur l'introduction des variables continues dans la théorie des nombres

  year unknowncited by this paper
• Sur l'introduction des variables continues dans la théorie des nombres.

  year unknowncited by this paper

• Diagonally dominant matrices for cryptography

  2025cites this paper
• PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning

  2025cites this paper
• A Key Encapsulation Mechanism from Low Density Lattice Codes

  2024cites this paper
• Trapdoor Memory-Hard Functions

  2024cites this paper
• Connecting Kani's Lemma and path-finding in the Bruhat-Tits tree to compute supersingular endomorphism rings

  2024cites this paper
• Computing the Hermite Normal Form: A Survey

  2024influential citation
• Embedding Integer Lattices as Ideals into Polynomial Rings

  2023influential citation
• A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix

  2022cites this paper
• Gottesman-Kitaev-Preskill codes: A lattice perspective

  2021cites this paper
• On the Impossibility of Purely Algebraic Signatures

  2021cites this paper
• On the Impossibility of Short Algebraic Signatures

  2021cites this paper
• Storage efficient algorithm for Hermite Normal Form using LLL

  2021cites this paper
• Securely and Efficiently Computing the Hermite Normal Form of Integer Matrices via Cloud Computing

  2020cites this paper
• Random Integer Lattice Generation via HNF

  2020cites this paper
• Computing Hermite Normal Form Faster via Solving System of Linear Equations

  2019influential citation
• A Development of LAF for Satisfying Assignments Search

  2019cites this paper
• Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices

  2019cites this paper
• More Efficient Algorithms for the NTRU Key Generation using the Field Norm

  2019cites this paper
• Computing a Lattice Basis Revisited

  2019cites this paper
• 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, August 27-31, 2018

  2018cites this paper
• The complexity of disjunctive linear Diophantine constraints

  2018cites this paper
• A Linear Algebra Formulation for Boolean Satisfiability Testing

  2017cites this paper
• Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme

  2017cites this paper
• An Efficient Version of the Bombieri-Vaaler Lemma

  2017cites this paper
• Rigid Motions on Discrete Spaces

  2017cites this paper
• Attacks on Secure Logging Schemes

  2017cites this paper
• On random nonsingular Hermite Normal Form

  2016cites this paper
• A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups

  2016cites this paper
• Approximate Algorithms on Lattices with Small Determinant ( Extended Abstract )

  2016cites this paper
• Bijectivity Certification of 3D Digitized Rotations

  2016influential citation
• Generalized low density lattices for GGH cryptosystem

  2016cites this paper
• Improving GGH cryptosystem using generalized low density lattices

  2016cites this paper
• A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]

  2016cites this paper
• algorithm for the Principal Ideal Problem and application to the cryptanalysis of a FHE scheme

  2016cites this paper
• Fast Lattice Point Enumeration with Minimal Overhead

  2015cites this paper
• Geometric Invariants for Fusion Categories

  2015influential citation
• Revisiting fully homomorphic encryption schemes and their cryptographic primitives

  2014cites this paper
• Deterministic Unimodularity Certication and Applications for

  2013cites this paper
• Hermite normal forms and its cryptographic applications

  2013cites this paper
• Deterministic Unimodularity Certification and Applications for Integer Matrices

  2013cites this paper
• Mathematics of Public Key Cryptography

  2012cites this paper
• Improving GGH cryptosystem for large error vector

  2012cites this paper
• Hermite Forms of Polynomial Matrices

  2011cites this paper
• An efficient method of 3D road automatic generating

  2011cites this paper
• Computing hermite forms of polynomial matrices

  2011cites this paper
• A library to manipulate Z-polyhedra in image representation

  2011cites this paper
• Fast computation of Hermite normal forms of random integer matrices

  2010influential citation
• Fully Homomorphic Encryption

  2010cites this paper
• On decomposable semigroups and applications

  2010cites this paper
• Lattice theory, circular statistics and polynomial phase signals

  2010cites this paper
• Natural density distribution of Hermite normal forms of integer matrices

  2010cites this paper
• Recursive Lattice Reduction

  2010cites this paper
• Bonsai Trees, or How to Delegate a Lattice Basis

  2010cites this paper
• Enhancing N-Gram-Hirschberg Algorithm by Using Hash Function

  2009cites this paper
• Broadcast Attacks against Lattice-Based Cryptosystems

  2009cites this paper
• Invariant Lie polynomials in two and three variables.

  2009cites this paper
• Generating Shorter Bases for Hard Random Lattices

  2009cites this paper
• Fast Computation of Hermite Normal Forms of

  2009cites this paper
• Efficient lattice-based signature scheme

  2008cites this paper
• A digital signature scheme based on CV P

  2008cites this paper
• Computation of Storage Requirements for Multi-Dimensional Signal Processing Applications

  2007cites this paper
• A Digital Signature Scheme Based on CV P∞

  2007cites this paper
• Introductory Algebra, Topology, and Category Theory

  2006cites this paper
• Fast LLL-type lattice reduction

  2006cites this paper
• Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications

  2005cites this paper
• Some Connections Between Learning Integer Lattices with Noise and Learning Parity Functions with Noise

  2003cites this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002cites this paper
• Cryptography and Lattices

  2001cites this paper
• Improving Lattice Based Cryptosystems Using the Hermite Normal Form

  2001cites this paper