Hello everyone, I have been playing around with JavaScript AES CBC encryption of a 25MB video file. I encrypt the file on the server with PHP which takes only a few seconds. I then use the library slowAES [http:// code.google.com/p/slowaes/] to decrypt the file in the browser. The decryption took 5 minutes. I profiled the code with the chrome developer tools and found out that the function "mixcolums" was be far the slowest. I had a look at this function and found out, that the Galois Field multiplications could also be done by table lookup which should be much faster. So I changed the code to do the look-up instead of calculation everything new everytime. But the code was actually slower then before. Now I would like to know: Why is this? Should array look-up not be the fastest method of doing things?
Kind regards, Simon Heckmann -- v8-users mailing list [email protected] http://groups.google.com/group/v8-users
