A linear space algorithm for computing the Hermite Normal Form

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 231-236

  Micciancio, D ^a   Warinschi, B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CALCULATIONS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA; NORMAL DISTRIBUTION; POLYNOMIALS; RANDOM PROCESSES;

HERMITE NORMAL FORM; HEURISTIC ALGORITHM; INTEGER MATRIX; LINEAR SPACE ALGORITHM;

ALGORITHMS;

EID: 0034782091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384133     Document Type: Conference Paper

References (24)

1. Generating hard instances of lattice problems (extended abstract)
2. Algorithms for the solution of systems of linear Diophantine equations
3. Exact solution of linear equations using p-adic expansions
4. Residual Hermite normal form computations
5. Hermite normal form computation using modulo determinant arithmetic
6. On the worst-case complexity of integer gaussian elimination
7. Tensor-based trapdoors for CVP and their application to public key cryptography
8. Polynominal time algorithms in the theory of linear diophantine equations
9. Complexity question in number theory
10. Public-key cryptosystems from lattice reduction problems
11. A rigurous subexponential algorithm for computation of class groups
12. Asymptotically fast triangularization of matrices over rings
13. Sur l'introduction des variables continues dans la théorie des nombres
14. An application of the Hermite normal form in integer programming
15. 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
16. Fast parallel computation of Hermite and Smith forms of polynomial matrices
17. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix
18. Improving lattice based cryptosystems using the Hermite normal form
19. Beyond unimodular transformation
20. Computing Hermite and Smith normal forms of triangular integer matrices
21. Asymptotically fast computation of Hermite normal forms of integer matrices
22. Diophantine linear system solving
23. Computing Popov and Hermite forms of polynomial matrices