[Imaginary CTF 2024]pacap
| ID： | 13161 |
|---|---|
| 标题： | [Imaginary CTF 2024]pacap |
| 描述： | The "capac" challenge from Crypto CTF 2024 can be directly solved by factorizing the modulus, but is it still solvable if the modulus is much larger? Original challenge is made by @factoreal. 请提交flag内容的MD5值，如flag内容为`ictf{test}`，则提交`NSSCTF{md5(test)}`，即`NSSCTF{098f6bcd4621d373cade4e832627b4f6}` |
| 类型： | CRYPTO |
| 网站： | NSSCTF |
| 题目链接： | https://www.nssctf.cn/problem/5718 |
| 赛事： | Imaginary |
| 年度： | 2024 |
| Flag值： | ictf{pacap_is_b4sic_crypto_ch4lleng3_w1th_4_sma11_tw1st} |
| writeup： | https://github.com/maple3142/My-CTF-Challenges/blob/master/ImaginaryCTF%202024/pacap/README.md |