Measuring, simulating and exploiting the head concavity phenomenon in BKZ

DOI10.1007/978-3-030-03326-2_13zbMath1446.94097OpenAlexW4299525276MaRDI QIDQ1633461

Damien Stehlé, Shi Bai, Weiqiang Wen

Publication date: 20 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_13

zbMATH Keywords

lattice-based cryptographyBlockwise-Korkine-Zolotarev (BKZ) lattice reduction algorithmrefined BKZ simulator

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ Mean value formulas on sublattices and flags of the random lattice ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Improving convergence and practicality of slide-type reductions ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ On the success probability of solving unique SVP via BKZ ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) ⋮ A physical study of the LLL algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Secret-sharing schemes for very dense graphs
• Multiple assignment scheme for sharing secret
• Secret sharing over infinite domains
• Protecting data privacy in private information retrieval schemes
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Towards breaking the exponential barrier for general secret sharing
• The complexity of multiparty PSM protocols and related models
• Generic transformations of predicate encodings: constructions and applications
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Conditional disclosure of secrets via non-linear reconstruction
• Linear secret-sharing schemes for forbidden graph access structures
• A minimal model for secure computation (extended abstract)
• Secret Sharing Schemes for Dense Forbidden Graphs
• 2-Server PIR with Sub-Polynomial Communication
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• White-Box Cryptography in the Gray Box
• Universally ideal secret-sharing schemes
• Partial Garbling Schemes and Their Applications
• Breaking the circuit-size barrier in secret sharing
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
• On the Cryptographic Complexity of the Worst Functions
• Dual System Encryption via Predicate Encodings
• The communication complexity of private simultaneous messages, revisited

This page was built for publication: Measuring, simulating and exploiting the head concavity phenomenon in BKZ