[Cryptosystem] RSA-CRT w/ FME

[Kazeon]

[Cryptosystem] RSA-CRT

just gy this, have no use

 

[Cokemonkey11]

Unfortunately worthless without virtualized integers. integer just can't handle any practical example of RSA.

Also, IsRound:

return m - R2I(m) == 0.

Edit: You should also implement a debug thread crash verification, and maybe even work around them.

 

[Kazeon]

Unfortunately worthless without virtualized integers. integer just can't handle any practical example of RSA.

because the value is always too big? dunno, but I hope CRT and FME fix it

Also, IsRound:

check.

EDIT:
I have found another way to encypt/decrypt huge number by separating the integer into several blocks, which each blocks only contain 3 digits, will try to implement it later..

EDIT 2:

Edit: You should also implement a debug thread crash verification, and maybe even work around them.

check. thank you

updated.
- Added some debug messages
- Fixed some possible thread crashes
- Fixed bug on Power function

next time I will try to make this library capable to encrypt & decrypt strings

 

[Ceday]

Edit: Oh good idea.

 

[Cokemonkey11]

because the value is always too big? dunno, but I hope CRT and FME fix it

It can be seen in a toy example with small values, but RSA is supposed to be used with 2048 bit modulii -> 617 digit number.

I have found another way to encypt/decrypt huge number by separating the integer into several blocks, which each blocks only contain 3 digits, will try to implement it later..

Better, but probably not worth your time...

 

[Kazeon]

It can be seen in a toy example with small values, but RSA is supposed to be used with 2048 bit modulii -> 617 digit number.



Better, but probably not worth your time...

so, what must I do? request for GY again?

EDIT:
btw, the code above has been updated with several hotfixes

 

[Cokemonkey11]

so, what must I do? request for GY again?

Well, you implemented it. It's a complete toy representation of RSA. I don't see how it would be any more useful with virtualized integers. I wouldn't say it belongs in GY though..

 

[Kazeon]

I think somehow you can collaborate any save load system with RSA well, encrypting string is rather useless in wc3, so I will cancel my plan to add that functionality. still, I will try to use second encrypt decrypt method so that you can encrypt any huge number..

 

[gorillabull]

neither this nor the one you copied it from works for me i wish nestarus was still here @_@

 

[Krogoth]

Sorry for an offtopic, but why he left?

 

[Kazeon]

neither this nor the one you copied it from works for me i wish nestarus was still here @_@

I have updated it
it's must be working now, I was encrypting m instead of M (plaintext)

 

[Dr Super Good]

Complex encryption/check sums ares worthless in WC3 as people will just use the map to do all the encryption/decryption.

Might have value purely as an academic task though.

Could possibly be useful when communicating with a hosting robot. However such strict implementations are not good for map long-levity as only custom host robot versions (closed source) can host it and use the feature.

 

[Almia]

Sorry, I don't think you don't have the Coprime function. It is the most important part of the Totient.

 

[Frotty]

Actual application of this library ey? There are
a lot of uses but I dont know what can we use this for wc3 modding. Just for fun I guess!

Kinda makes submitting it pointless.

 

[Kazeon]

Sorry, I don't think you don't have the Coprime function. It is the most important part of the Totient.

if GCD(m, i) == 1 then

there it is the coprime function (one line) did you say it correctly? don't think I don't have?

Kinda makes submitting it pointless.

TH courages me to make this D:

 

[Almia]

@Dalvengyr
Grammar dude. we aint perfect.

 

[Kazeon]

just to make sure

Complex encryption/check sums ares worthless in WC3 as people will just use the map to do all the encryption/decryption.

Might have value purely as an academic task though.

Could possibly be useful when communicating with a hosting robot. However such strict implementations are not good for map long-levity as only custom host robot versions (closed source) can host it and use the feature.

yup, it's actually just a conversion from c++ (my homework) to jass with some new better and improved algorithms. I think this should work properly as I have tested it when it was still in c++

 

[Menag]

This looks very useful. Going to encrypt my mega-secret messages with this.

 

[Kazeon]

thanks for the troll

 

[Almia]

How about encrypting a message by getting it's bytes then using RSA to transform those bytes?

 

[Kazeon]

How about encrypting a message by getting it's bytes then using RSA to transform those bytes?

That's still kinda pointless and has no use for wc3 modding