An experimental comparison of some LLL-type lattice basis reduction algorithms
type: Item
instance of: scholarly article
title: An experimental comparison of some LLL-type lattice basis reduction algorithms
zbMATH Open document ID: 1392.11097
author: Dimitris G. Papachristoudis
author: Spyros T. Halkidis
author: George Stephanides
published in: International Journal of Applied and Computational Mathematics
publication date: 2018-07-27T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6911256
zbMATH Keywords: LLL
zbMATH Keywords: \(L^2\)
zbMATH Keywords: buffered transformations
zbMATH Keywords: lattice basis reduction
describes a project that uses: NTRU
describes a project that uses: SageMath
describes a project that uses: Python
MaRDI profile type: Publication
full work available at URL: s40819-014-0023-5
OpenAlex ID: W1975398469
cites work: Q4526993
cites work: An Efficient LLL Gram Using Buffered Transformations
cites work: Heuristics on lattice basis reduction in practice
cites work: Post-Quantum Cryptography
cites work: Q3092534
cites work: Q4364546
cites work: An Introduction to Mathematical Cryptography
cites work: Q3840170
cites work: Q4460278
cites work: Factoring polynomials with rational coefficients
cites work: An LLL Algorithm with Quadratic Complexity
cites work: Floating-Point LLL Revisited
cites work: The LLL algorithm. Survey and applications
cites work: An LLL-reduction algorithm with quasi-linear time complexity
cites work: Q4266548
DOI: 10.1007/S40819-014-0023-5
description: scientific article; zbMATH DE number 6911256