Describe algorithm

[pintman]

I am not so much into JS. Could you please give a desciption of the algorithm? Would be great to have it in other languages as well.

[fallais]

https://github.com/fallais/tweg

[holloway]

Nice one @fallais !

[fallais]

This is just a description and a translation of your great work @holloway ;)
I discovered your tool thanks to a rootme challenge.

That being said, I had a couple of questions (if you have time) :

• Why is there a space added right after the secret binary ?
• The ensure_divisible_xxxxx gave me so much pain ! The numbers are so long that I had not the same result with Golang and Javascript. My opinion is that you are lucky because the behaviour of Javascript when performing the toNumber function (before the modulo) is going well. I wasn't lucky with Golang. So I am still not getting this function totally well, still trying to explain it perfectly.
• I was wondering if it could be a good idea to trim all the spaces of the secret after it has been decoded. I mean if the decoding function returns "youpi ", I guess that "youpi" is also a good answer.