PBKZ algorithm and its application in lattice challenge

DOI10.16366/J.CNKI.1000-2367.2020.05.001MaRDI QIDQ3385805zbMATH OpenFDO

Authors Minghao Sun, Longjiang Qu, Chao Li

Publication date 14 January 2021

Full work available at URL https://doi.org/10.16366/J.CNKI.1000-2367.2020.05.001

zbMATH Keywords

Darmstadt lattice challengelattice reduction algorithmprogressive BKZ algorithmSVP problem

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• Explicit Hard Instances of the Shortest Vector Problem
• A lattice reduction algorithm based on sublattice BKZ
• Analyzing blockwise lattice algorithms using dynamical systems
• Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem

Cited in

(1)

• On a class of strongly asymmetric PKA algorithms

This page was built for publication: PBKZ algorithm and its application in lattice challenge

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