A hkz reduction method and system for complex number fields
A complex number field and reduction technology, applied in the field of HKZ reduction method and system in the complex number field, can solve the problems of high uncertainty, increased complexity, and large amount of calculation in LLL reduction in the complex number field, so as to save the amount of calculation and save Iterative, low-complexity effects
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0078] The present invention discloses a HKZ reduction method working in the field of complex numbers. The main contents of the present invention include three aspects: first, we give a lemma for complex number lattices and prove it; then according to the proof of this lemma, we give An algorithm for constructing unimodal matrices in the complex field is proposed, and it is named as the sub-algorithm UNIH; finally, a HKZ reduction algorithm that directly works on the complex field and has lower complexity than the existing algorithms is constructed, and it is named the algorithm CHKZ.
[0079] 1. Lemma and proof
[0080] Lemma: For an m-dimensional complex lattice a lattice vector of it The necessary and sufficient condition for expanding into a new base is: gcd(z 1 ,...,z m )=1. For a Gaussian integer z 1 ,...,z m , gcd(z 1 ,...,z m ) represents their greatest common divisor, that is, their greatest common divisor with a positive real part (ie the one with the large...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


