crypto-ctf
Lab/CTF: crypto challenges; ciphertexts, keys, signatures, oracles, transcripts, PRNG, RSA/ECC/lattice/math protocol code.
v2026.11.13-21cd5683 installs+3 in 7 days39 StarsMITsynced 11 hours ago
Install
No NotHoly CLI yet? Install it first.
$ curl -fsSL https://notholy.com/install.sh | sh$ notholy skills install aeondave/crypto-ctfWrites to ~/.notholy/skills after checking the signature and the SHA-256.
SignatureSigned, ed25519
Packagee0052631…f3316cdf
e0052631a279…ac9df3316cdf14 files · 123.6 KBScanLow1 finding
- Links to outside domains
Sourcegithub.com/AeonDave/malskill/tree/main/offensive-ctf/crypto-ctf@21cd568
On this page
Goal: solve cryptography challenge solving tasks with professional offensive methodology, preserved imported technique coverage, and reproducible evidence.
When this skill applies
- ciphertexts, keys, signatures, oracles, transcripts, proofs, PRNG outputs, or mathematical protocol code
- RSA, ECC, DH, DSA/ECDSA, lattice/LWE, PRNG, symmetric-mode, stream-cipher, ZKP, secret-sharing, or exotic algebraic weaknesses
Operating model
- Classify the dominant artifact, primitive, or objective.
- Load the closest
offensive-techniquesmethodology before selecting tools. - Load references only for deep technique details.
- Choose the smallest tool chain that can produce a validation signal.
- Record the exact proof path and stop once the objective is reproducible.
Technique integration
Primary methodology to load:
crypto-techniquecracking-technique
Use these as decision engines. This skill adds challenge-oriented triage, time-boxing, and preserved specialized patterns from the imported corpus.
Tool routing
Prefer these tool families when the corresponding signal appears:
rsactftoolsagemathcyberchefhashcatjohncoding/python-patterns
Tool syntax belongs in the tool skills. This skill decides when a tool family fits and what output should validate progress.
Category-specific quick pivots
- Extract parameters before choosing attacks: modulus, exponent, curve order, nonce, IV, oracle response, random source, and serialization.
- Rank attacks by structural evidence: factorability, smoothness, nonce reuse, small roots, linear recurrence, or mode misuse.
- Validate recovered material by re-encryption, signature verification, oracle replay, or known plaintext.
Targeted hint research
Load known-problem-hint-research when an external clue could identify the primitive, reveal a missing construction, or suggest the next test. Search from observed structure; do not wait until attacks are ranked or local hypotheses are exhausted.
Quality gates
- No claim without a validation signal: recovered secret, replayed exploit, decoded artifact, reproduced model behavior, or corroborated evidence.
- Do not brute force before representation, constraints, and success oracle are known.
- Keep a pivot ledger: hypothesis, evidence, result, next shortest path.
- Preserve coverage by keeping every operational topic reachable from the Resources routing below.
- Keep challenge/platform/competition names out of notes and generated reports.
Resources
Modern Cipher Attacks
- references/modern-cipher-modes-and-forgery.md — AES/CFB/CBC/CTR/GCM/OFB mode failures, padding and decode oracles, bit-flip/cut-and-paste forgeries, cookie/session tampering, and practical ciphertext manipulation workflows.
- references/modern-hash-mac-and-collision-attacks.md — Hash/MAC weaknesses: length extension, CRC misuse, chosen-prefix and multi-collision workflows, linear-MAC breaks, and aggregate-hash forgery patterns.
- references/modern-oracles-protocols-and-custom-crypto.md — Protocol and design failures: Bleichenbacher/Rabin/Blum-Goldwasser oracles, SRP and KDF flaws, reduced-round/custom constructions, and algebraic attack pivots.
RSA Attacks
- references/rsa-attacks.md — Small exponent recovery, common modulus attacks, Wiener's attack, Pollard p-1 factorization, Hastad broadcast, Fermat factorization, multi-prime RSA, restricted-digit primes, Coppersmith attacks, Manger's padding oracle, specialized RSA (p=q bypass, gcd(e,phi)>1, phi-multiple factoring, CRT faults, homomorphic bypass, batch GCD, partial key recovery), signature forgery (homomorphic, Bleichenbacher, low-exponent), ROCA attack (CVE-2017-15361), timing attacks, dependent-prime RSA, three-key GCD.
Exotic Cryptography
- references/exotic-crypto.md — Braid group DH (Alexander polynomial multiplicativity), monotone function inversion, tropical semiring residuation, Paillier homomorphic encryption, Hamming codes, ElGamal variants, format-preserving encryption Feistel, icosahedral symmetry group cipher, Goldwasser-Micali ciphertext replication, BB-84 quantum key distribution MITM.
PRNG & Key Recovery
- references/prng.md — Mersenne Twister state recovery (untemper, symbolic solving), MT from random.random() floats via GF(2) matrix (not_random library), time-based seed attacks, C srand/rand via ctypes, layered encryption recovery, LCG parameter recovery, ChaCha20 key recovery, GF(2) matrix PRNG seed recovery, middle-square PRNG brute-force, deterministic RNG from flag bytes (hill climbing), byte-by-byte oracle, RSA key reuse, logistic map/chaotic PRNG seed recovery, V8 XorShift128+ state recovery (Math.random prediction), and CTF-era advanced techniques (MT constraint propagation, Z3 timing oracle, cellular automaton LFSR, Java LCG MITM), EC-LCG state recovery from truncated EC coordinates.
Elliptic Curve Attacks
- references/ecc-attacks.md — Small subgroup attacks, invalid curve attacks, Smart's attack, ECDSA nonce reuse, curve order factorization, twist attacks, anomalous curves, special-form curve weaknesses, BLS aggregate signature rogue-key attacks, proof-of-possession bypass.
Advanced Mathematics
- references/advanced-math.md — Isogenies and CSIDH, Pohlig-Hellman algorithm, LLL lattice reduction, Coppersmith small-roots method, Clock group DLP, Babai nearest-plane algorithm, CVP/SVP solvers, GF(2) linear algebra, generalized birthday attacks, sparse polynomial systems.
Lattice & LWE
- references/lattice-and-lwe.md — Load for lattice/LWE equations, partial-nonce recovery, or ML-KEM/NTRU artifacts: parameter and representation checks, reduction methods and candidate validation.
Classic Ciphers
- references/classic-ciphers.md — Vigenere cipher frequency analysis, Atbash simple substitution, Polybius square attacks, substitution cipher key recovery, XOR-based cipher analysis, pattern matching and constraint solving.
Stream Ciphers
- references/stream-ciphers.md — LFSR feedback polynomial recovery, RC4 state recovery and keystream prediction, XOR-based stream cipher weaknesses, mode misuse (reusing nonces/IVs), correlated keystream analysis.
Historical Ciphers
- references/historical.md — Lorenz SZ40/42 rotor machine analysis, book cipher key recovery, pre-modern cryptanalysis techniques, mechanical cipher exploitation.
ZKP & Advanced Techniques
- references/zkp-and-advanced.md — Zero-knowledge proof attacks, interactive proof verification bypass, Z3 SMT solver application, garbled circuits (generator/evaluator attacks), Shamir secret sharing, race conditions in crypto protocols, Fiat-Shamir heuristic vulnerabilities.
Files in this version
references/13329.2 KB
- advanced-math.md26.6 KB
- classic-ciphers.md26.4 KB
- ecc-attacks.md18.5 KB
- exotic-crypto.md40.3 KB
- historical.md4.4 KB
- lattice-and-lwe.md17.0 KB
- modern-cipher-modes-and-forgery.md32.5 KB
- modern-hash-mac-and-collision-attacks.md21.3 KB
- modern-oracles-protocols-and-custom-crypto.md25.8 KB
- prng.md38.0 KB
- rsa-attacks.md41.5 KB
- stream-ciphers.md16.5 KB
- zkp-and-advanced.md20.4 KB
- SKILL.md7.4 KB
Permissions
| Permission | Declared | Found by the scan |
|---|---|---|
| Reads files | Yes | Yes |
| Writes files | Yes | Yes |
| Runs shell commands | Yes | Yes |
| Uses the network | Yes | Yes |
| Uses connectors | No | No |
| Drives a browser | No | No |
Scan findings
Reviewed on Nov 13, 2026
- InfoLink · Links to outside domains
A clean scan lowers the risk but does not prove a package is safe. Read what you install.
| Version | Published | Commit | SHA-256 | Signature | Permission change |
|---|---|---|---|---|---|
| v2026.11.13-21cd568 | Nov 13, 2026 | 21cd568 | e0052631 | Signed | – |
More from AeonDave
All from this publisherMore in Reverse engineering and fuzzing
See the categoryAsk anything your scope allows.
Create an account, add credits and ask the first question in the chat or the terminal.
- 1/3
Create the account
Individual or company. You can switch to a company later without losing balance or keys.
IndividualCompany - 2/3
Add credits
By card. Pay per token, no subscription.
$5.00minimum deposit - 3/3
Ask
In the chat, or install the CLI and run notholy login in your terminal.
$ notholy login