A Modified KZ Reduction Algorithm

2015/04/20 by Jinming Wen, Wen, Jinming, Xiao-Wen Chang +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Digital Filter Design and Implementation #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1504.05086

has been accepted by IEEE ISIT 2015

arxiv created 2015/04/20 · openalex publication_date 2015/04/20 · arxiv updated 2015/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Korkine-Zolotareff (KZ) reduction has been used in communications and cryptography. In this paper, we modify a very recent KZ reduction algorithm proposed by Zhang et al., resulting in a new algorithm, which can be much faster and more numerically reliable, especially when the basis matrix is ill conditioned.

Citations

• A hierarchy of polynomial time lattice basis reduction algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

Related

• On the KZ Reduction
• Improved Upper Bounds on the Hermite and KZ Constants
• Block Korkin-Zolotarev algorithm generalization and their practical implementation (Russian)
• Short review of lattice basis reduction types and his applications (Russian)
• A hierarchy of polynomial time lattice basis reduction algorithms