Attachmentscrypto - 3000 solves

Xace fua eno el lex jat fesela. La kinunsaresen rironen ernlarnkael'i lius, cene niurnen asti'e laozia. Pa, liaxo vileti's moni'akda'i kalzanenon cerkmern...

Note: The flag of this challenge is in the format of farvil{.+}.

Overview, Concept and Design Criteria

The key vulnerability is small subgroup attack under multiplicative DHKE. By sending a element in that small group, there won't be too much possible shared secrets.

This is a simple modern crytographic challenge, which may deserve 100 points in normal CTF. However, this challenge requires you to have some basic knowledge of number theory, otherwise you won't even notice the existence of subgroup. I also put some effort to make it more interesting to experienced crypto solvers, such as introducing a guest account, PBKDF2, using flag as password, and the most confusing one: obfuscation by a obsecure language.

About the language

The description and the program of this challenge is written in Lineparine (リパライン語, 理語), an artificial language created by Fafs F. sashimi. The vulnerability is not related to the language, so it is still solvable if you treat the source code as obfustrated. It just sets the crytographic tone for the whole challenge perfectly :)

If you are interesting to the meanings, there's English translation in translation.txt. I'm not a master of Lineparine, I guess there are many mistakes in this challenge. If you know how to write in Lineparine fluently, please help me to improve the challenge :)

I spent about 10 hours designing this challenge, where 9 hours are used to translate to Lineparine LOL.



Send a element in a small group and guess the shared secret.

You need to know some basic group theory.

  • The order of finite field Zp\mathbb{Z}_p over prime pp is p1p - 1. [Euler's totient function]
  • A prime number qq dividing the order of G\mathbf{G} implies the existence of subgroup with order qq. [Cauchy's theorem)]
  • The order of every subgroup of G\mathbf{G} divides the order of G\mathbf{G}. [Lagrange's theorem)]

First we have to check whether pp is a prime. And then find the order of Zp\mathbb{Z}_p by factorizing p1p - 1, you will get 2, 49391, and a large prime qq. So there's subgroup with order 2, 49391 and qq.

The generator of order 2 subgroup is -1, which cannot be used in this challenge.

To find an generator of subgroup with order 49391, you can select a random number r that is not 1 or -1, and calculate gg by: r(p1)/49391modpr^{(p - 1) / 49391} \mod p Order of gg should be 49391 because that according to Fermet's little theorem: g49391=r(p1)=1modpg^{49391} = r^{(p - 1)} = 1 \mod p This method may output 11 with probability of 1/493911 / 49391, if you're too lucky to get 11, try again.

The shared secret have only 49391 possible values. You can check which one is correct using sha256 MAC inside the message.

See also

Small subgroup attack is a very old but common mistake in DH/ECDH is not handled correctly, and it still appears in modern softwares. One most recently example is CVE-2018-5383 on Bluetooth pairing, which use a invalid curve of order 2 (Strictly speaking, it actually using another curve which has exactly same arithmetic operation rather than subgroup).