Basic connection Habbo.SWF RSA

[Glee]

I'm guessing these are the new RSA keys?

private static const _-5Vf:String = "3";
        private static const _-0J7:String = ((("90e0d43db75b5b8ffc8a77e31cc9758fa43fe69f14184bef64e61574beb18fac" + "32520566f6483b246ddc3c991cb366bae975a6f6b733fd9570e8e72efc1e511f") + "f6e2bcac49bf9237222d7c2bf306300d4dfc37113bcc84fa4401c9e4f2b4c41a") + "de9654ef00bd592944838fae21a05ea59fecc961766740c82d84f4299dfb33dd"); 

If so which one is which?

[MentaL]

[AKllX]

3 is the Public Expoent ('e') and stands for hex 0x3. All strings are hex.

90e0d43db75b5b8ffc8a77e31cc9758fa43fe69f14184bef64e61574beb18fac is 'P' or 'Q' the order doesn't matter. They are called the 'large primes'.
32520566f6483b246ddc3c991cb366bae975a6f6b733fd9570e8e72efc1e511f is 'P' or Q' and must be exactly equal in bits

f6e2bcac49bf9237222d7c2bf306300d4dfc37113bcc84fa4401c9e4f2b4c41a is 'D mod(P-1)' or 'D mod(Q-1)', again the order doesnt matter
de9654ef00bd592944838fae21a05ea59fecc961766740c82d84f4299dfb33dd is 'D mod(P-1)' or 'D mod(Q-1)'.

We need 'n' and it's definition is n=P*Q;


Now,we must use the congruence modulo operation. https://www.khanacademy.org/computin...gruence-modulo

The multiplication of D mod(P-1) and D mod(Q-1) is associative, therefore Dmod(P-1)*Dmod(Q-1) = Dmod((P-1)*(Q-1)). We need 'D', and we find it multiplying by e's inverse. So,

D = e^-1 mod ((P-1)*(Q-1))

The 'Public Key' everyone talks about is a 2D vector 'e' and 'n': K(e,n)
Similarly the 'Private Key' is a 2D vector of 'd' and 'n' : k(d,n)

Let's say you want to encrypt a message 'm'.

Suppose m(hex) < n(hex). If not, break the message in smaller chunks of same size.

The encrypted message is a function of three variables: the 2D vector 'Public Key' and 'm' :
EncryptedM(m,K(e,n)) = m^e*mod(n)
The decrypted message is the inverse:
DecryptedM(EncryptedM,k(d,n)) = EncryptedM^d*mod(n)

But that's just the basics as you asked. For a complete view, see more about:
Euler's totient function (theta);
Diffie-Hellman key exchange applyied to Fermat's Little Theorem.

Correct me if I'm wrong,
Cheers.

[Glee]

So what do I need to change in order to connect to the server because without the proper codes, I won't be able to connect...