Cover Image

Wagner's Algorithm Provably Runs in Subexponential Time for SIS$^\infty$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ducas, Léo, Engelberts, Lynn, Loyer, Johanna
Format:	Preprint
Published:	2025
Subjects:	Cryptography and Security Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Wagner's k-Tree Algorithm Over Integers
by: Lin, Haoxing, et al.
Published: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

Improving Algorithmic Efficiency using Cryptography
by: Vaikuntanathan, Vinod, et al.
Published: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)

Sublinear Space Graph Algorithms in the Continual Release Model
by: Epasto, Alessandro, et al.
Published: (2024)

An Affine Equivalence Algorithm for S-boxes based on Matrix Invariants
by: Hu, Xincheng, et al.
Published: (2024)

Differentially Private Algorithms for Graphs Under Continual Observation
by: Fichtenberger, Hendrik, et al.
Published: (2021)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2024)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
by: Cummings, Rachel, et al.
Published: (2025)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
by: Chandra, Rishi, et al.
Published: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
by: Dhulipala, Laxman, et al.
Published: (2025)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
by: Aggarwal, Divesh, et al.
Published: (2020)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
by: Joux, Antoine, et al.
Published: (2024)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
by: Kerschbaum, Florian, et al.
Published: (2025)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
by: Jain, Palak, et al.
Published: (2024)

Quantum Sieving for Code-Based Cryptanalysis and Its Limitations for ISD
by: Engelberts, Lynn, et al.
Published: (2024)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
by: Mundra, Pranay, et al.
Published: (2025)

Predicting Module-Lattice Reduction
by: Ducas, Léo, et al.
Published: (2025)

Private Lossless Multiple Release
by: Andersson, Joel Daniel, et al.
Published: (2025)

Space-Efficient Private Estimation of Quantiles
by: Cafaro, Massimo, et al.
Published: (2025)

Differentially Private Matchings
by: Dinitz, Michael, et al.
Published: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
by: Ghazi, Badih, et al.
Published: (2025)

Differentially Private Set Representations
by: Patel, Sarvar, et al.
Published: (2025)

Scalable Private Partition Selection via Adaptive Weighting
by: Chen, Justin Y., et al.
Published: (2025)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
by: Harrison, Charlie, et al.
Published: (2025)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
by: Harrison, Charlie, et al.
Published: (2025)

Nearly-Optimal Private Selection via Gaussian Mechanism
by: Leeman, Ethan, et al.
Published: (2025)

Heavy-Tailed Privacy: The Symmetric alpha-Stable Privacy Mechanism
by: Zawacki, Christopher C., et al.
Published: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
by: Dong, Wei, et al.
Published: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
by: Goodrich, Michael T., et al.
Published: (2024)

Fast and Optimal Differentially Private Frequent-Substring Mining
by: Guo, Peaker, et al.
Published: (2026)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
by: Ghazi, Badih, et al.
Published: (2024)

Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)

It is high time we let go of the Mersenne Twister
by: Vigna, Sebastiano
Published: (2019)

On Learning Parities with Dependent Noise
by: Golowich, Noah, et al.
Published: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

Local Node Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2026)

Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
by: Hladík, Richard, et al.
Published: (2024)

The Price of Privacy For Approximating Max-CSP
by: Dharangutte, Prathamesh, et al.
Published: (2026)