ctf-crypto

Attack cryptographic primitives in CTF challenges using Python and GMP libraries.

Updated May 15, 2026
One-click install
npx skills add https://github.com/a398275770-ctrl/ctf-skills --skill ctf-crypto-a398275770-ctrl
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: ctf-crypto
Source: https://github.com/a398275770-ctrl/ctf-skills/tree/main/ctf-crypto
Command: npx skills add https://github.com/a398275770-ctrl/ctf-skills --skill ctf-crypto-a398275770-ctrl

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires pycryptodome, z3-solver, sympy, gmpy2, hashpumpy, fpylll, py_ecc, hashcat, sagemath, and includes scripts (resource) and references (resource) and assets (resource) components.

What problem does it solve?

This Skill provides a comprehensive collection of cryptography attack techniques, enabling users to solve encryption, hashing, signature, ZKP, PRNG, and mathematical crypto problems in CTF challenges.

Core Features & Use Cases

  • Encryption Attacks: Break AES, RSA, ECC, and other encryption schemes using techniques like padding oracle, S-box collisions, and key recovery.
  • Hash Attacks: Identify and exploit vulnerabilities in hash functions like MD5, SHA-1, and SHA-256.
  • Signature Attacks: Break digital signatures and signcryption schemes.
  • Use Case: When encountering a crypto challenge in a Capture The Flag (CTF) event, this Skill can assist with breaking encryption, identifying vulnerabilities, and extracting secrets.

Quick Start

Use the ctf-crypto skill to factorize an RSA modulus with the given public key and private exponent.

Frequently Asked Questions about ctf-crypto

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I factorize an RSA modulus during a CTF cryptography challenge?

To break RSA encryption in CTF cryptography challenges, this Skill uses libraries like GMP and z3-solver to factorize the modulus and recover private keys from given public parameters.

What techniques are needed to break AES encryption and exploit hash functions?

Attacking AES encryption and hash functions involves applying padding oracle attacks, S-box collisions, and hash extension attacks targeting MD5 and SHA-1 vulnerabilities using specialized cryptographic libraries.

Can I use SageMath and z3-solver for cryptoanalysis of digital signatures and PRNGs?

Yes, SageMath and z3-solver support cryptoanalysis of digital signatures and PRNGs by applying algebraic and constraint-solving methods to break signcryption schemes and predict pseudorandom outputs.

Do I need prior knowledge of cryptographic algorithms to use ctf-crypto?

Yes, using ctf-crypto requires familiarity with cryptographic algorithms and attack methods, as it provides advanced tools for encryption, hashing, and signature attacks without introductory theory.

What is the best way to attack ECC and other mathematical crypto problems?

The best way to attack ECC and mathematical crypto problems is by applying lattice reduction with fpylll and elliptic curve computations with py_ecc to exploit structural vulnerabilities in cryptographic schemes.

Why does my hash attack on SHA-256 fail during cryptoanalysis?

Hash attacks on SHA-256 often fail during cryptoanalysis because SHA-256 lacks the structural vulnerabilities present in MD5 and SHA-1, making collision and extension attacks computationally infeasible.