Well, seems the questions are CTF related because the patterns of n, e, and c are weak numbers. You can solved it with RsaCtfTool ... <看更多>

With this tool you'll be able to calculate primes, encrypt and decrypt message(s) using the RSA algorithm. Currently all the primes between 0 and 1500000 are ... ... <看更多>

... <看更多>

Decrypt RSA encrypted data with Nec given. GitHub Gist: instantly share code, notes, and snippets. ... <看更多>

I'm sorry @J0ker, I found new answer (maybe there are errors value in my first answer). My new answer m= ... <看更多>