|
Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com |
Optimized Java Algorithms
Eric Rescorla (ekr
rtfm.com)
Tue, 14 Sep 1999 09:12:53 -0700
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
- Next message: Arnold Reinhold: "RE: Paul Brown on Solitiare randomness flaw?"
- Previous message: Kuehn, Ulrich: "RE: Paul Brown on Solitiare randomness flaw?"
Yeah, I know that "Optimized Java" is oxymoronic, but
nevertheless I'm hoping to lay my hands on optimized
Java implementations of DES and/or SHA.
There seem to be a number of different Java DESes
floating around, all with about equivalent performance.
This may indicate that this is a natural limit, but
it may indicate that noone's tried very hard. The fact
that many of them appear to be straight ports of Eric
Young's DES suggests the latter.
I'd provide benchmarks, but performance varies so widely
(1.5 orders of magnitude) between VMs that that sor tof
number is worthless.
If I have to optimize one of these implementations myself,
I will, but I'm too lazy to do so without checking first.
Cheers,
-Ekr
[Eric Rescorla ekr
rtfm.com]
PureTLS - free SSLv3/TLS software for Java
http://www.rtfm.com/puretls/
- Next message: Arnold Reinhold: "RE: Paul Brown on Solitiare randomness flaw?"
- Previous message: Kuehn, Ulrich: "RE: Paul Brown on Solitiare randomness flaw?"
This archive was generated by hypermail 2.0b3 on Tue Sep 14 1999 - 17:40:26 CDT