ctf-crypto-attacks

Solve CTF cryptographic challenges involving RSA, elliptic curves, and lattices.

Updated May 25, 2026

Search Tags:#ctf #rsa #crypto #lcg #lattice reduction #elliptic curve

Ready to run

npx skills add https://github.com/zaiyemeiyou404/Hermes --skill ctf-crypto-attacks

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: ctf-crypto-attacks
Source: https://github.com/zaiyemeiyou404/Hermes/tree/main/backup/skills/red-teaming/ctf-crypto-attacks
Command: npx skills add https://github.com/zaiyemeiyou404/Hermes --skill ctf-crypto-attacks

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires sage, sympy, gmpy2, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill equips users with advanced cryptographic techniques to solve Capture The Flag (CTF) challenges involving RSA, elliptic curves, and lattice-based attacks.

Core Features & Use Cases

Lattice Attacks: Execute attacks like LLL, BDD, and Gaussian integer Coppersmith on RSA, ECDH, and LCG challenges.
Supersingular ECDH: Apply Pohlig-Hellman and MOV attacks on supersingular elliptic curves.
Shared RSA Exponent: Factor RSA moduli with shared exponents using joint lattices.
LCG Prediction: Recover parameters of linear congruential generators from their outputs.
Sudoku Bilinear Convolution: Solve Sudoku puzzles with bilinear convolution over finite fields.
Use Case: For a CTF challenge involving RSA with noisy samples, this Skill can be used to recover the hidden prime p and factor the RSA modulus.

Quick Start

Use the ctf-crypto-attacks skill to factor the RSA modulus from the given ciphertext samples.

Frequently Asked Questions about ctf-crypto-attacks

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

FAQPage Schema

How do I factor an RSA modulus with noisy ciphertext samples in a CTF challenge?▼

To factor an RSA modulus with noisy samples, you can use lattice reduction techniques like LLL or Gaussian integer Coppersmith to recover the hidden prime p and factor the RSA modulus.

What is the best way to recover parameters from a linear congruential generator (LCG)?▼

Recovering parameters from a linear congruential generator (LCG) involves applying lattice reduction techniques to its outputs to reconstruct the underlying hidden state and modulus values.

How does a lattice attack work on supersingular elliptic curve Diffie-Hellman (ECDH)?▼

A lattice attack on supersingular ECDH works by applying Pohlig-Hellman and MOV attacks to exploit supersingular elliptic curve properties and recover the shared secret.

Can I use sympy and gmpy2 to execute Coppersmith attacks on shared RSA exponents?▼

Yes, you can use sympy and gmpy2 to execute Coppersmith attacks, applying joint lattices to factor RSA moduli when they share exponents across different ciphertext samples.

Do I need Sage to solve cryptographic CTF challenges involving lattice reduction?▼

Yes, you need Sage alongside sympy and gmpy2, as these Python libraries are required dependencies for executing advanced cryptographic operations and lattice algorithms.

When should I use Gaussian integer Coppersmith instead of standard LLL for cryptographic attacks?▼

Use Gaussian integer Coppersmith for specific lattice attacks on RSA and ECDH challenges where standard LLL or BDD approaches are insufficient for recovering hidden primes.