{
  "slug": "ai-grinding-cryptanalysis",
  "name": "AI Grinding for cryptanalysis (research)",
  "tagline": "Agents generate high-volume hypotheses; exact adversarial tests decide",
  "maintainer": "Olejnik and Naskrecki (academic)",
  "url": "https://arxiv.org/abs/2608.21986",
  "category": "crypto-zk",
  "targets": [
    "Published cryptographic constructions",
    "Cryptanalysis"
  ],
  "approach": "Autonomous workflow: agents propose low-precision attack hypotheses, an exact, adversarially controlled test provides evidence",
  "license": "Research paper",
  "status": "Research (2026-08-22)",
  "summary": "A 2026 paper describing an autonomous cryptanalysis workflow in which agents produce many low-precision hypotheses and an exact, adversarially controlled test decides which count as evidence. It claims reproducible failures in eight published constructions and is the reference for applying the candidate-plus-oracle pattern to cryptography itself rather than code.",
  "details": [
    "Together with zkSecurity's report on an LLM finding a flaw in a SNARG paper, it shows the method reaching cryptographic design, not only implementation."
  ],
  "strengths": [
    "Exact tests remove hallucination.",
    "Targets design-level flaws."
  ],
  "limits": [
    "Not a product.",
    "Requires building the exact test per construction.",
    "Claims await independent reproduction."
  ],
  "fit": [
    "Read it if you design protocols; the pattern is what a serious AI cryptanalysis service will look like."
  ],
  "references": [
    [
      "AI Grinding for Fun and Cryptanalysis (arXiv 2608.21986)",
      "https://arxiv.org/abs/2608.21986"
    ],
    [
      "When LLMs review cryptography papers (zkSecurity, 2026-02-10)",
      "https://blog.zksecurity.xyz/posts/llms-in-research/"
    ]
  ],
  "category_name": "Cryptography and ZK specialists",
  "page": "https://agentsast.com/tools/ai-grinding-cryptanalysis/",
  "updated": "2026-09-13"
}