Daniele Micciancio
Bogdan Warinschi
ABSTRACT
Computing the Hermite Normal Form of an n × n integer matrix using the best current algorithms typically requires Ο(n3 log M) space, where M is a bound on the entries of the input matrix. Although polynomial in the input size (which is Ο(n2 log M)), this space blow-up can easily become a serious issue in practice when working on big integer matrices. In this paper we present a new algorithm for computing the Hermite Normal Form which uses only Ο(n2 log M) space (i.e., essentially the same as the input size). When implemented using standard algorithms for integer and matrix multiplication, our algorithm has the same time complexity of the asymptotically fastest (but space inefficient) algorithms. We also present a heuristic algorithm for HNF that achieves a substantial speedup when run on randomly generated input matrices.
- 1.AJTAI, M. Generating hard instances of lattice problems (extended abstract). In Proceedings of the Twenty-Eighth Annual A CM Symposium on the Theory of Computing (Philadelphia, Pennsylvania, 22-24 May 1996), pp. 99-108.]] Google Scholar
Digital Library
- 2.Cnou, T. W. J., AND COLLINS, G. E. Algorithms for the solution of systems of linear Diophantine equations. SIAM Journal on Computing 11, 4 (1982), 687-708.]]Google Scholar
- 3.DIXON, J. Exact solution of linear equations using p-adic expansions. Numerical Mathematics 40 (1982), 137-141.]]Google ScholarCross Ref
- 4.DOMICH, P. D. Residual Hermite normal form computations. ACM Trans. Math. Software 15, 3 (1989), 275-286.]] Google ScholarDigital Library
- 5.DOMICH, P. D., R.KANNAN, AND L.E.TROTTER. Hermite normal form computation using modulo determinant arithmetic. Mathematics of Operations Research 1P, 1 (Feb. 1987), 50-59.]] Google ScholarDigital Library
- 6.FANG, X. G., AND HAVAS, G. On the worst-case complexity of integer gaussian elimination. In Proceedings of the 1997 22nd International Symposium on Symbolic and Algebraic Computation, ISSA C (Maui, HI, USA, 1997), ACM, pp. 28-31.]] Google ScholarDigital Library
- 7.FISCHLIN, a ., AND SEIFERT, J.-P. Tensor-based trapdoors for CVP and their application to public key cryptography. In 7th IMA International Conference "Cryptography and Coding" (1999), vol. 1746 of Lecture Notes in Computer Science, Springer-Verlag, pp. 244-257.]] Google ScholarDigital Library
- 8.FRUMKIN, M. A. Polynominal time algorithms in the theory of linear diophantine equations. In Proceedings of the 1977 International Conference on Fundamentals of Computation Theory (Poznafi-KSrnik, Poland, Sept. 1977), M. Karpifiski, Ed., vol. 56 of LNCS, Springer, pp. 386-392.]]Google Scholar
- 9.FRUMKIN, M. A. Complexity question in number theory. J. Soviet Math., 29 29 (1985), 1502-1517.]]Google ScholarCross Ref
- 10.GOLDREICH, 0 ., GOLDWASSER, S., AND HALEVI, S. Public-key cryptosystems from lattice reduction problems. In Advances in Cryptology--CRYPTO '97 (17-21 Aug. 1997), B. S. Kaliski Jr., Ed., vol. 1294 of Lecture Notes in Computer Science, Springer-Verlag, pp. 112-131.]] Google ScholarDigital Library
- 11.HAFNER, J. L., AND McCURLEY, K. S. A rigurous subexponential algorithm for computation of class groups. J. Amer. Math. Soc. 2 (1989), 837-850.]]Google ScholarCross Ref
- 12.HAFNER, J. a., AND McCURLEY, K. S. Asymptotically fast triangularization of matrices over rings. SIAM Journal on Computing P0, 6 (1991), 1068-1083.]] Google ScholarDigital Library
- 13.HERMITE, C. Sur l'introduction des variables continues dans la thorie des hombres. J. Reine Angew. Math. 41 (1851), 191-216.]]Google ScholarCross Ref
- 14.HUNG, M. S., AND ROM, W. O. An application of the Hermite normal form in integer programming. Linear Algebra and its Applications 149 (1990), 163-179.]]Google ScholarCross Ref
- 15.ILIOPOULOS, C. S. 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. SIAM Journal on Computing 18, 4 (1989), 658-669.]] Google ScholarDigital Library
- 16.KALTOFEN, E., KRISHNAMOORTHY, M., AND SAUNDERS, B. Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. ALg. Disc. Math (1987), 683-690.]] Google ScholarDigital Library
- 17.KANNAN, R., AND BACHEM, A. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM Journal on Computing 8, 4 (Nov. 1979), 499-507.]]Google ScholarCross Ref
- 18.MICCIANCIO, D. Improving lattice based cryptosystems using the Hermite normal form. In Cryptography and Lattices Conference 2001 (2001), LNCS, Springer-Verlag.]] Google ScholarDigital Library
- 19.RAMANUJAM, J. Beyond unimodular transformation. The Journal of Supercomputing 9, 4 (1995), 365-389.]] Google ScholarDigital Library
- 20.STORJOHANN, A. Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra and its Applications 282, 1-3 (1998), 25-45.]]Google ScholarCross Ref
- 21.STORJOHANN, A., AND LABAHN, G. Asymptotically fast computation of Hermite normal forms of integer matrices. In ISSAC'96 (Zurich, Switzerland, 1996), ACM, pp. 259-266.]] Google ScholarDigital Library
- 22.STORJOHANN, A., AND MULDERS, T. Diophantine linear system solving. In ISSAC'99 (Zurich, Switzerland, 1999), ACM, pp. 181-188.]] Google ScholarDigital Library
- 23.VILLARD, G. Computing Popov and Hermite forms of polynomial matrices. In Proceedings of the 1996 international symposium on Symbolic and algebraic computation (1996), pp. 250-258.]] Google ScholarDigital Library
- 24.VON ZUR GATHEN, J., AND GERHARD, J. Modern Computer Algebra. Cambridge University Press, Cambridge, 1999.]] Google ScholarDigital Library
Index Terms
- A linear space algorithm for computing the hermite normal form
Recommendations
Computing Hermite Normal Form Faster via Solving System of Linear Equations
ISSAC '19: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic ComputationAs a canonical form for integer matrices, Hermite Normal Form (HNF) has been widely used in various fields such as computational number theory and cryptography. In previous algorithms, arithmetic modulo the determinant is usually used to control the ...
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix
A Las Vegas randomized algorithm is given to compute the Hermite normal form of a nonsingular integer matrix A of dimension n. The algorithm uses quadratic integer multiplication and cubic matrix multiplication and has running time bounded by O(n3 (log n +...
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
AbstractA Las Vegas randomized algorithm is given to compute the Smith multipliers for a nonsingular integer matrix A, that is, unimodular matrices U and V such that A V = U S, with S the Smith normal form of A. The expected running time of ...
Comments