Measuring, simulating and exploiting the head concavity phenomenon in BKZ

DOI10.1007/978-3-030-03326-2_13zbMATH Open1446.94097OpenAlexW4299525276MaRDI QIDQ1633461FDOQ1633461

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Multiple assignment scheme for sharing secret
• Secret sharing over infinite domains
• Secret-sharing schemes for very dense graphs
• Title not available (Why is that?)
• Universally ideal secret-sharing schemes
• On the Cryptographic Complexity of the Worst Functions
• Protecting data privacy in private information retrieval schemes
• A minimal model for secure computation (extended abstract)
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
• Linear secret-sharing schemes for forbidden graph access structures
• Dual System Encryption via Predicate Encodings
• Secret Sharing Schemes for Dense Forbidden Graphs
• The communication complexity of private simultaneous messages, revisited
• 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
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Conditional disclosure of secrets via non-linear reconstruction
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• Partial Garbling Schemes and Their Applications
• Breaking the circuit-size barrier in secret sharing
• Generic transformations of predicate encodings: constructions and applications
• 2-Server PIR with Sub-Polynomial Communication
• White-Box Cryptography in the Gray Box

Cited In (13)

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

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)