Upper and lower bound on the cardinality containing shortest vectors in a lattice reduced by block Korkin-Zolotarev method (Russian)

2013/02/17 by Usatyuk, Vasiliy
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1302.4062

Abstract

This article present a concise estimate of upper and lower bound on the cardinality containing shortest vector in a lattice reduced by block Korkin-Zolotarev method (BKZ) for different value of the block size. Paper show how density affect to this cardinality, in form of the ratio of shortest vector size and sucessive minimal. Moreover we give upper estimate of cardinality for critical and Goldstein-Mayer lattices.

Related

• Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases
• Block Korkin-Zolotarev algorithm generalization and their practical implementation (Russian)
• Minkowski bases, Korkin-Zolotarev bases and successive minima
• A hierarchy of polynomial time lattice basis reduction algorithms
• On the KZ Reduction