# rsactftool/rsactftool

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/rsactftool-rsactftool).**

6,988 stars · 995 forks · Python · MIT

## Links

- GitHub: https://github.com/RsaCtfTool/RsaCtfTool
- awesome-repositories: https://awesome-repositories.com/repository/rsactftool-rsactftool.md

## Topics

`cryptography` `rsa` `rsa-attack`

## Description

RsaCtfTool is an RSA cryptanalysis tool designed to recover private keys from weak public keys and decrypt protected data. It functions as an integer factorization tool and a framework for executing lattice-based attacks.

The project differentiates itself by combining database-driven factorization algorithms with specialized mathematical exploits. It includes a suite for lattice reduction to target small exponents and a converter to transform SSH public keys into PEM format for compatibility with other analysis software.

The software covers broad capability areas including RSA moduli factorization, private key recovery, and the execution of non-factorization attacks. It provides utilities for parsing public keys and performing the modular arithmetic required for cryptographic analysis.

## Tags

### Security & Cryptography

- [RSA Cryptanalysis](https://awesome-repositories.com/f/security-cryptography/rsa-cryptanalysis.md) — Breaks weak RSA public keys to recover private keys and decrypt protected data.
- [Lattice-Based Attack Frameworks](https://awesome-repositories.com/f/security-cryptography/lattice-based-attack-frameworks.md) — Provides a suite of tools for executing cryptographic attacks based on lattice reduction to exploit small exponents.
- [Lattice-Based Attacks](https://awesome-repositories.com/f/security-cryptography/lattice-based-attacks.md) — Recovers RSA keys using mathematical exploits that target small exponents without factoring the modulus.
- [Private Key Recovery](https://awesome-repositories.com/f/security-cryptography/private-key-recovery.md) — Implements mathematical exploits to recover private keys from weak public key parameters.
- [Lattice-Based Recoveries](https://awesome-repositories.com/f/security-cryptography/private-key-recovery/lattice-based-recoveries.md) — Uses Coppersmith methods and lattice reduction to recover private exponents.
- [Moduli Factorizations](https://awesome-repositories.com/f/security-cryptography/rsa-cryptanalysis/moduli-factorizations.md) — Decomposes composite moduli into prime factors using specialized and database-driven algorithms. ([source](https://github.com/rsactftool/rsactftool#readme))
- [Non-Factorization Attacks](https://awesome-repositories.com/f/security-cryptography/rsa-cryptanalysis/non-factorization-attacks.md) — Recovers keys using lattice reduction and mathematical exploits targeting small exponents. ([source](https://github.com/rsactftool/rsactftool#readme))
- [RSA Decryption](https://awesome-repositories.com/f/security-cryptography/rsa-decryption.md) — Unciphers data encrypted with weak RSA public keys by breaking the encryption mechanism. ([source](https://github.com/rsactftool/rsactftool#readme))
- [SSH Key Converters](https://awesome-repositories.com/f/security-cryptography/ssh-key-converters.md) — Transforms SSH public keys into PEM format for compatibility with cryptographic analysis software.
- [SSH-to-PEM Conversions](https://awesome-repositories.com/f/security-cryptography/ssh-key-management/ssh-to-pem-conversions.md) — Transforms SSH public keys into PEM format to ensure compatibility with cryptographic tools. ([source](https://github.com/rsactftool/rsactftool#readme))
- [PEM Formatting](https://awesome-repositories.com/f/security-cryptography/tls-certificate-management/pem-formatting.md) — Converts public key structures into standardized PEM files for interoperability with analysis software.

### Scientific & Mathematical Computing

- [Prime Factorization Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/prime-factorization-algorithms.md) — Decomposes composite RSA moduli into prime factors using local algorithms and database lookups.