Improved lattice enumeration algorithms by primal and dual reordering methods

DOI10.1007/978-3-031-08896-4_8OpenAlexW4286758959MaRDI QIDQ2104429

Eiichiro Fujisaki, Kazuki Yamamura, Yun-Tao Wang

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_8

zbMATH Keywords

dual latticeenumeration algorithmlattice cryptographyreordering method

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Related Items (1)

Lattice-based public key cryptosystems invoking linear mapping mask

Uses Software

• NTL
• BKZ
• NTRU

Cites Work

• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Improving the BKZ reduction algorithm by quick reordering technique
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Practical, Predictable Lattice Basis Reduction
• BKZ 2.0: Better Lattice Security Estimates
• Lattice Enumeration Using Extreme Pruning
• A method for obtaining digital signatures and public-key cryptosystems
• A sieve algorithm for the shortest lattice vector problem
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved lattice enumeration algorithms by primal and dual reordering methods