It seems one-p-rsa has been defeated ...
Beginner Hint 1 (AI-translated)
- Unlike one-p-rsa, the exponent
eis changed from65537to65538. - As a result, the naive solution for one-p-rsa no longer works.
- First, think about why the original approach stops working.
Beginner Hint 2 (AI-translated)
- In one-p-rsa,
p-1andewere coprime, so it was possible to compute the inverse ofemodulop-1. - This challenge is different. Since
efactors as2 * 3^2 * 11 * 331,gcd(e, p-1)is even. It also has about a 1/2 chance to be a multiple of 3, becausep-1 mod 3is either 0 or 1. - In this case, how can we solve it?
- By leveraging SageMath, you can solve it more easily.