Free ℤ-module
Summary In this article we formalize a free ℤ-module and its rank. We formally prove that for a free finite rank ℤ-module V , the number of elements in its basis, that is a rank of the ℤ-module, is constant regardless of the selection of its basis. ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic systems with lattice [15]. Some theorems in this article are described by translating theorems in [21] and [8] into theorems of Z-module.
Keyword(s):
Keyword(s):
1978 ◽
Vol 48
◽
pp. 515-521
Keyword(s):
1973 ◽
Vol 31
◽
pp. 444-445
1973 ◽
Vol 31
◽
pp. 324-325
◽
1978 ◽
Vol 36
(1)
◽
pp. 100-101
Keyword(s):