Individual skill
cryptography
Cryptanalysis techniques — lattice attacks, padding oracles, weak-RNG exploitation, signature forgery, secret-sharing recovery.
skills/cryptography/SKILL.md
Source commit 95fdc128af4ca1ae16b3226f9430f1bad97b0656
What was checked
- Matches the observed repository HEAD
- Yes
- Scanner rules are current
- Yes
- Repository scan complete
- No
- Skill scan complete
- No
- Observed behavior
- Network or broad shell
- Last checked
- Nov 10, 2026
These are observations at the recorded commit, not a guarantee of safety. Review the source before running it.
Install this skill
Choose an agent in your Stack or copy a command below. Commands fetch the pinned commit and copy only this skill directory. Existing destinations are refused. Copying a command does not install anything.
An install command is unavailable: current rules, complete repository and skill scans, an eligible behavior level and a permitted license are required.
Repository context
- Repository stars (not skill ratings)
- 613
- Repository last updated
- Jul 29, 2026
- License
- MIT
Observed agent integration: No specific integration evidence. Standard SKILL.md installation does not imply verified compatibility.
- bounty-hunters Repository topic
- hackerone Repository topic
- pentest Repository topic
- pentest-tool Repository topic
- security Repository topic
- security-research Repository topic
- security-tools Repository topic
- engineering Derived category
Files and excerpt
File metadata and permitted, redacted excerpts come from the recorded scan. Source links are pinned to that commit.
Browse files
SKILL.mdcore · 1,869 bytesSKILL.mdcore · 1,869 bytesreference/INDEX.mddoc · 3,806 bytesreference/cryptography-principles.mddoc · 4,980 bytesreference/lattice-attacks.mddoc · 7,335 bytesreference/linear-secret-recovery.mddoc · 3,424 bytesreference/scenarios/classical/repeating-key-xor.mddoc · 2,435 bytesreference/scenarios/lattice/agcd-attack.mddoc · 2,727 bytesreference/scenarios/lattice/boneh-durfee-low-d.mddoc · 2,807 bytesreference/scenarios/lattice/coppersmith-known-bits.mddoc · 3,132 bytesreference/scenarios/lattice/lll-basis-reduction.mddoc · 3,246 bytesreference/scenarios/padding-oracle/cbc-padding-oracle.mddoc · 3,660 bytesreference/scenarios/padding-oracle/ecb-prefix-oracle.mddoc · 3,766 bytesreference/scenarios/padding-oracle/pkcs1-v1.5-bleichenbacher.mddoc · 3,400 bytesreference/scenarios/rsa-quirks/common-modulus.mddoc · 2,462 bytesreference/scenarios/rsa-quirks/fermat-close-primes.mddoc · 2,473 bytesreference/scenarios/rsa-quirks/low-public-exponent.mddoc · 3,084 bytesreference/scenarios/rsa-quirks/small-prime-factorization.mddoc · 3,616 bytesreference/scenarios/rsa-quirks/wiener-attack.mddoc · 2,743 bytesreference/scenarios/secret-sharing/shamir-non-prime-modulus.mddoc · 5,147 bytesreference/scenarios/signature-forgery/ecdsa-nonce-reuse.mddoc · 3,187 bytesreference/scenarios/signature-forgery/gcd-transcript-operand-recovery.mddoc · 10,000 bytesreference/scenarios/signature-forgery/jwt-alg-confusion.mddoc · 4,569 bytesreference/scenarios/signature-forgery/rsa-pkcs1-v1.5-bleichenbacher.mddoc · 3,553 bytesreference/scenarios/weak-rng/dual-ec-backdoor.mddoc · 3,418 bytesreference/scenarios/weak-rng/lcg-state-recovery.mddoc · 3,598 bytesreference/scenarios/weak-rng/mt19937-state-recovery.mddoc · 3,662 bytes
Read excerpt
# Cryptography
## Scope
Practical cryptanalysis for CTF and pentest engagements: identifying when a cryptographic primitive's structure (custom hash, partial leaks, related primes, bad RNG, weak modes) admits a faster-than-brute-force solver, then implementing that solver in pure Python where possible. Covers RSA-style algebraic factoring, lattice/AGCD recovery, GF(2) linear collapse of "complicated-looking" custom ciphers, smooth-order DLP, differential fault attacks, and Shamir-style secret-sharing recovery over non-prime moduli. Always read source first to detect linearity/algebraic structure before reaching for SageMath or symbolic solvers.
## When to use
- A challenge or target ships **custom crypto** (custom hash, custom block cipher, hand-rolled key derivation) and you need to look for affine / GF(2)-linear collapse.
- RSA-style primitives with **structured primes** (`p = a·r + b`, `phi(n)` perfect square, multi-prime hint files, common factors).
- A service exposes a **chosen-ciphertext / chosen-input oracle** and you suspect padding-oracle, smooth-order DLP, or Bleichenbacher-style recovery.
- AES with **fault injection** (correct + faulty ciphertext for the same key — Piret-Quisquater DFA).
- Shamir secret sharing or threshold schemes with non-prime moduli (2-adic recovery via Lagrange interpolation with valuation tracking).