Writeup by Valar_Dragon

  • Cryptography
  • 200 points
  • The communication between WikiLeaks and their informant is protected asymmetrically. Fortunately for you, they each have a little something in common. input

So we have two messages, (presumably the same plaintext), encrypted with two separate public exponents, under the same modulus. What can we do with this? Lets denote what we have as:

We know that which means that there exists some such that

This is known as the bezout identity, exactly the parameters extended euclidean algorithm solves for!

Now, lets see if we can use this finding

Now notice the exponent is our bezout identity, so we really are left with

which is just our message!

So now we just have to program this. Obtaining is trivial with the extended euclidean algorithm. So we just modpow and multiply as normal, with the caveat that a negative power is really just the absolute value of that power, but of the multiplicative modular inverse of the base.

Writing this in, we get:



So I actually helped the admin fix this problem. Originally, the problem had one modulus, two public exponents, 65537, and 65538, and two ciphertexts. Since 65538 is an invalid public exponent, my assumption was it was the same message (from chal name), and that you just multiply modular inverse of the ciphertext for the 65537th power against the other ciphertext, so that the exponent would add to 1, and would leave you the message!

It turns out however, that there were several layers of errors on the admins end, that I helped fix. Essentially the attack was supposed to be a common modulus attack, where the same message was encrypted with two different public exponents, same modulus. Except two different messages were being encrypted at the time. There were also a few additional complications.

To help fix the problem, I ended up wroting a solver for how problem should've been, showed to admin, then helped fix generation code, then problem got updated and we solved it.

results matching ""

    No results matching ""