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.
Type de document :
Pré-publication, Document de travail
2016
Liste complète des métadonnées

https://hal.inria.fr/hal-01403926
Contributeur : Gilles Villard <>
Soumis le : lundi 28 novembre 2016 - 10:33:26
Dernière modification le : vendredi 20 avril 2018 - 15:44:26

Lien texte intégral

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

91