A Vectorized, Cache Efficient LLL Implementation

DOI10.1007/978-3-319-61982-8_16MaRDI QIDQ5862555zbMATH OpenOpenAlexFDO

Authors Artur Mariano, Fábio Correia, Christian H. Bischof

Publication date 9 March 2022

Published in High Performance Computing for Computational Science – VECPAR 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-61982-8_16

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Yxx)

Cites work

• scientific article; zbMATH DE number 1852137 (Why is no real title available?)
• scientific article; zbMATH DE number 1852138 (Why is no real title available?)
• Factoring polynomials with rational coefficients
• Floating-Point LLL Revisited
• Floating-Point LLL: Theoretical and Practical Aspects
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

Cited in

(1)

• Cache-efficient renumbering for vectorization

This page was built for publication: A Vectorized, Cache Efficient LLL Implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862555)