Measuring, simulating and exploiting the head concavity phenomenon in BKZ

DOI10.1007/978-3-030-03326-2_13MaRDI QIDQ1633461zbMATH OpenOpenAlexFDO

Authors Shi Bai, Damien Stehlé, 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)

Recommendations

• BKZ 2.0: Better lattice security estimates
• On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
• Analyzing blockwise lattice algorithms using dynamical systems
• Analysis of DeepBKZ reduction for finding short lattice vectors
• Second order statistical behavior of LLL and BKZ

Cites work

• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• A minimal model for secure computation (extended abstract)
• Breaking the circuit-size barrier in secret sharing
• Communication complexity of conditional disclosure of secrets and attribute-based encryption
• Conditional disclosure of secrets via non-linear reconstruction
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Dual System Encryption via Predicate Encodings
• Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
• General secure multi-party computation from any linear secret-sharing scheme
• Generic transformations of predicate encodings: constructions and applications
• Linear secret-sharing schemes for forbidden graph access structures
• Multiple assignment scheme for sharing secret
• On the Cryptographic Complexity of the Worst Functions
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Partial garbling schemes and their applications
• Protecting data privacy in private information retrieval schemes
• Secret sharing over infinite domains
• Secret sharing schemes for dense forbidden graphs
• Secret-sharing schemes for very dense graphs
• The communication complexity of private simultaneous messages, revisited
• The complexity of multiparty PSM protocols and related models
• Towards breaking the exponential barrier for general secret sharing
• Universally ideal secret-sharing schemes
• White-box cryptography in the gray box

Cited in

(19)

• Towards faster polynomial-time lattice reduction
• On the success probability of solving unique SVP via BKZ
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• NTRU Fatigue: How Stretched is Overstretched?
• Second order statistical behavior of LLL and BKZ
• The Taylor-Culick profile with arbitrary headwall injection
• A physical study of the LLL algorithm
• Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
• Analyzing blockwise lattice algorithms using dynamical systems
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Improving convergence and practicality of slide-type reductions
• \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 the BKZ reduction algorithm by quick reordering technique
• BKZ 2.0: Better lattice security estimates
• Revisiting security estimation for LWE with hints from a geometric perspective
• A complete analysis of the BKZ lattice reduction algorithm
• Mean value formulas on sublattices and flags of the random lattice
• Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance

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

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