TAPAS: Datasets for Learning the Learning with Errors Problem
Not on the map. Why?
Abstract (arXiv)
AI-powered attacks on Learning with Errors (LWE), an important hard math problem in post-quantum cryptography, rival or outperform "classical" attacks on LWE under certain parameter settings. Despite the promise of this approach, a dearth of accessible data limits AI practitioners' ability to study and improve these attacks. Creating LWE data for AI model training is time- and compute-intensive and requires significant domain expertise. To fill this gap and accelerate AI research on LWE attacks, we propose the TAPAS datasets, a Toolkit for Analysis of Post-quantum cryptography using AI Systems. These datasets cover several LWE settings and can be used off-the-shelf by AI practitioners to prototype new approaches to cracking LWE. This work documents TAPAS dataset creation, establishes attack performance baselines, and lays out directions for future work.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 38 references that are in the map. First posted on arXiv 9 Oct 2025.
Builds on
12 of 38 references.
References · 12
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2024FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AIcited by 243
- 2022SALSA: Attacking Lattice Cryptography with Transformerscited by 28
- 2023SALSA PICANTE: a machine learning attack on LWE with binary secretscited by 11
- 2023SALSA VERDE: a machine learning attack on Learning With Errors with sparse small secretscited by 8
- 2024Salsa Fresca: Angular Embeddings and Pre-Training for ML Attacks on Learning With Errorscited by 7
- 2024The cool and the cruel: separating hard parts of LWE secretscited by 4
- 2024Benchmarking Attacks on Learning with Errorscited by 4
- 2024Making Hard Problems Easier with Custom Data Distributions and Loss Regularization: A Case Study in Modular Arithmeticcited by 4
- 2023An efficient algorithm for integer lattice reductioncited by 3
- 2015Provably weak instances of Ring-LWEcited by 2
Built on by
Not cited yet.