pentest_ctf_rsa
Analyze RSA challenges by factoring small moduli with trial division, Fermat, or Pollard rho, testing Wiener and perfect-square cases, and decrypting ciphertext when provided.
Instructions
RSA analysis: factor small n (trial/Fermat/Pollard rho), Wiener, perfect square; decrypt if c given.
Integers as decimal or 0x-hex strings to preserve precision.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| c | No | ||
| e | Yes | ||
| n | Yes |