Full Lattice Basis Reduction on Graphics Cards

DOI10.1007/978-3-642-34159-5_3MaRDI QIDQ2920408zbMATH OpenOpenAlexFDO

Authors Timo Bartkewitz, Tim Güneysu

Publication date 16 October 2012

Published in Research in Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34159-5_3

zbMATH Keywords

all-swap algorithmCUDAGivens rotationsgraphics cardslattice basis reductionparallelization

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Cryptography (94A60)

Recommendations

• Non-abelian self-dual string solutions
• Supersymmetric fivebrane solitons
• Exact string-theory instantons by dimensional reduction
• The self-dual string soliton
• Giant graviton interactions and M2-branes ending on multiple M5-branes

Cited in

(4)

• Supersymmetric fivebrane solitons
• A parallel Jacobi-type lattice basis reduction algorithm
• Parallel shortest lattice vector enumeration on graphics cards
• Accelerating lattice reduction with FPGAs

Describes a project that uses

Uses Software

• NTL
• CUDA
• OpenCL
• NTRU
• SWIFFT

This page was built for publication: Full Lattice Basis Reduction on Graphics Cards

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