GfcLLL: A Greedy Selection Based Approach for Fixed-Complexity LLL Reduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2016

GfcLLL: A Greedy Selection Based Approach for Fixed-Complexity LLL Reduction

Abstract

A greedy selection based approach GfcLLL for fixed-complexity LLL reductions (FCLLL) is proposed. Two greedy selection strategies are presented. Simulations show that each of the two strategies gives Babai points with lower bit error rate in a more or less equal or much shorter CPU time than existing FCLLL algorithms.

Dates and versions

hal-01403926 , version 1 (28-11-2016)

Identifiers

Cite

Jinming Wen, Xiao-Wen Chang. GfcLLL: A Greedy Selection Based Approach for Fixed-Complexity LLL Reduction. 2016. ⟨hal-01403926⟩
64 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More