|
Yumi Murakami
DoIt!AttachTheEarOfACat!
Join date: 27 Sep 2005
Posts: 6,860
|
05-12-2006 09:32
LSL has a handy llModPow function.. but does anyone know if there is any (possibly out-of-world) utility for generating key pairs for 64-bit (!) non-pseudo RSA?
|
|
Talarus Luan
Ancient Archaean Dragon
Join date: 18 Mar 2006
Posts: 4,831
|
05-12-2006 11:32
Probably, but the question is would you want to wait for the hours of days it would probably take to un in LSL. Well, OK, it may not take days, but it would take a good LONG time.
I implemented XTEA encryption in LSL, and it takes a long time to do encryption/decryption.
My take is that better encryption functions need to be made part of the library call lists, as LSL user functions are just to slow for real encryption use.
|
|
Nexus Nash
Undercover Linden
Join date: 18 Dec 2002
Posts: 1,084
|
05-12-2006 12:53
Indeed. we only have the power of a TI calculator. I know some people have made basic encryptions, but I couldn't tell you about them  |
|
BamBam Sachertorte
floral engineer
Join date: 12 Jul 2005
Posts: 228
|
05-12-2006 17:22
You would be better off waiting for 1.9.1 and then using HTTP to offload the task to a server somewhere. llModPow is useless.
|
|
Eddy Stryker
libsecondlife Developer
Join date: 6 Jun 2004
Posts: 353
|
05-12-2006 23:39
I wrote some functions to do binary math and also for Diffie-Helman key exchanges, I can tell you that doing a proper 64-bit encryption system in LSL would likely take hours per message.
|