Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Jinming Wen 1 Xiao-Wen Chang 2
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-01403926
Contributor : Gilles Villard <>
Submitted on : Monday, November 28, 2016 - 10:33:26 AM
Last modification on : Thursday, June 18, 2020 - 12:32:05 PM

Links full text

Identifiers

  • HAL Id : hal-01403926, version 1
  • ARXIV : 1607.01064

Collections

Citation

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

Share

Metrics

Record views

176