mlsanityData to 7 Oct 2026

Salsa Fresca: Angular Embeddings and Pre-Training for ML Attacks on Learning With Errors

arXiv 2402.01082 ↗First posted 2 Feb 2024cs.CR cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Learning with Errors (LWE) is a hard math problem underlying recently standardized post-quantum cryptography (PQC) systems for key exchange and digital signatures. Prior work proposed new machine learning (ML)-based attacks on LWE problems with small, sparse secrets, but these attacks require millions of LWE samples to train on and take days to recover secrets. We propose three key methods -- better preprocessing, angular embeddings and model pre-training -- to improve these attacks, speeding up preprocessing by 25× and improving model sample efficiency by 10×. We demonstrate for the first time that pre-training improves and reduces the cost of ML attacks on LWE. Our architecture improvements enable scaling to larger-dimension LWE problems: this work is the first instance of ML attacks recovering sparse binary secrets in dimension n=1024, the smallest dimension used in practice for homomorphic encryption applications of LWE where sparse binary secrets are proposed.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 27 of its 68 references that are in the map. First posted on arXiv 2 Feb 2024.

Builds on

27 of 68 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  6. 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
  7. 2018Universal Transformerscited by 613
  8. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  9. 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
  10. 2020Generative Language Modeling for Automated Theorem Provingcited by 379
  11. 2019Deep Learning for Symbolic Mathematicscited by 266
  12. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
15 more
  1. 2021Investigating the Limitations of Transformers with Simple Arithmetic Taskscited by 136
  2. 2023Teaching Arithmetic to Small Transformerscited by 121
  3. 2015Neural GPUs Learn Algorithmscited by 118
  4. 2023Grokking modular arithmeticcited by 77
  5. 2021Linear algebra with transformerscited by 62
  6. 2022SALSA: Attacking Lattice Cryptography with Transformerscited by 28
  7. 2015Grid Long Short-Term Memorycited by 19
  8. 2015Learning Simple Algorithms from Examplescited by 12
  9. 2023SALSA PICANTE: a machine learning attack on LWE with binary secretscited by 11
  10. 2020Can Sequence-to-Sequence Models Crack Substitution Ciphers?cited by 9
  11. 2019Solving Math Word Problems with Double-Decoder Transformercited by 7
  12. 2021Solving Arithmetic Word Problems with Transformers and Preprocessing of Problem Textcited by 7
  13. 2023An efficient algorithm for integer lattice reductioncited by 3
  14. 2017Learning the Enigma with Recurrent Neural Networkscited by 2
  15. 2019Using fuzzy bits and neural networks to partially invert few rounds of some cryptographic hash functionscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 3.

7 papers.