[4.0.1:13205] Protocol information (Opcodes & Co.)

[kicho]

Cromon what exactly is the problem with decrypting ? from what I see algorythm is simple square and multiply ? aren't p and q those prime numbers , for that other i believe there is a code that calculates that faster and its present in some libs...? can you post example

[Cromon]

e and d are like that:
(e * d) mod phi(n) = 1. Its not possible to calculate phi(n) in reasonable time.

[kicho]

EDIT: you are right seems impossible...

[Hiperzone]

btw cromon, how are you dumping the opcodes? you made a ida script that searches for specific patterns/named functions?
i did a pattern finder long time ago but its quite slow lol since it parses the asm file first then searches a script file i made. Have yet to update it to latest version tough.

[fastelf]

Wish i knew how to code and try to make a logon server for the sake of it.. but i aint that good in c++ >.<

[Ballwinkle]

e and d are like that:
(e * d) mod phi(n) = 1. Its not possible to calculate phi(n) in reasonable time.

whats 'reasonable time'?

[The-Eradicator]

whats 'reasonable time'?

More than likely, "unreasonable time" means "by the time the next patch is out you'd be lucky to have opcodes for the previous one".

[kicho]

even longer

[Silinoron]

Prime-factoring a number of that size takes longer than the current age of the universe; currently the outlook on doing so for a large enough key is somewhere around 10^100 years. Yeah.

[Zerrow]

does these work in 4.0.3?

[amorganskate]

does these work in 4.0.3?

I'm pretty sure it's a no because op codes are random for each patch that blizzard releases.