What problem does it solve?
Consolidates actionable methods and references for solving CTF-style cryptographic challenges, reducing time spent searching across blogs and papers. Provides a structured decision tree and targeted exploit recipes so you can identify the right cryptanalysis technique quickly and reliably.
Core Features & Use Cases
- Structured decision tree covering classical ciphers, symmetric modes, RSA families, ECC pitfalls, lattice attacks, PRNG recovery, and ZKP quirks to guide triage.
- Curated technical references with worked patterns and code snippets for RSA small-exponent, common-modulus, Wiener, Coppersmith, padding oracle, LWE lattice attacks, MT19937 and xs128p recovery, and ECC failures.
- Tooling guidance describing when to use SageMath, gmpy2, fpylll, z3, PadBuster and other common CTF libraries plus practical tips (endian gotchas, precision, query budgets).
- Use case: triage a CTF challenge that presents an encrypted token, detect whether it is a padding oracle, small-exponent RSA, PRNG leak, or lattice problem, and follow the mapped procedure to recover the plaintext or key.
Quick Start
Ask the skill to analyze the challenge files and explain whether to apply small-exponent RSA, padding-oracle, PRNG state recovery, lattice/Coppersmith, or ECC techniques and list the next 3 concrete steps.