rsa-attack-techniques

What problem does it solve?

It helps you recover RSA plaintext when you have RSA parameters (n, e, ciphertexts) and the system is vulnerable due to weak keys, small exponents, shared factors, or exploitable oracle/fault conditions.

Core Features & Use Cases

• Attack Selection Playbook: Rapidly narrows down which RSA attack to attempt based on observable conditions (small n, small e, related messages, shared modulus factors, oracle access, or CRT faults).
• Mathematics-Informed Cryptanalysis Guidance: Provides clear methods spanning factorization, small-exponent exploits, lattice techniques (Wiener/Boneh-Durfee/Coppersmith), broadcast/common modulus, and padding-oracle/fault attacks.
• Detailed Implementations for Execution: Includes an “attack catalog” with mathematical derivations and implementation sketches (e.g., Pollard’s rho, Wiener full attack, RSA-CRT fault factoring, parity oracle, and Bleichenbacher flow).

Real-world use case

When you receive an RSA challenge where n is small enough to factor or where a padding/LSB oracle is observable, you can systematically identify the correct vulnerability class and apply the corresponding method to recover the message.

Quick Start

Load the skill and ask your AI: "Given n, e, and ciphertext c (plus any oracle outputs or fault evidence), which RSA attack should I run and what exact recovery steps should I follow?"