We propose a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr, using CPU arbitrary length Householder QR-decomposition for orthogonalization and double precision OpenCL GPU Finke-Post shortest vector enumeration. Empirical tests was used on random lattices in the sense of Goldstein and Mayer.
Cite
@article{arxiv.1210.6502,
title = {Block Korkin-Zolotarev algorithm generalization and their practical implementation (Russian)},
author = {Vasiliy Usatyuk},
journal= {arXiv preprint arXiv:1210.6502},
year = {2012}
}