Re: Speed of AES vs. SHA-1
From: adam (no@email.com)
Date: 04/18/03
- Next message: Carlos Moreno: "Re: Non-Random Coin Flip?"
- Previous message: adam: "Re: Speed of AES vs. SHA-1"
- In reply to: Roger Schlafly: "Re: Speed of AES vs. SHA-1"
- Next in thread: adam: "Re: Speed of AES vs. SHA-1"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: "adam" <no@email.com> Date: Fri, 18 Apr 2003 00:43:34 +0200
"Roger Schlafly" <rogersc@mindspring.com> wrote in message
news:%1lna.1791$N32.685457505@twister1.starband.net...
> "Tom" <teshrim@ucdavis.edu> wrote
> > How fast is the current best implementation of SHA-1? SHA-256?
>
> Do you care? Chances are that any implementation you find will
> be fast enough for your purposes.
If you want to hash files on disk, then even a slow C implementation is more
than good enough. If you want to brute-force find a hashed password, then an
optimized assembler function is preferred.
- Next message: Carlos Moreno: "Re: Non-Random Coin Flip?"
- Previous message: adam: "Re: Speed of AES vs. SHA-1"
- In reply to: Roger Schlafly: "Re: Speed of AES vs. SHA-1"
- Next in thread: adam: "Re: Speed of AES vs. SHA-1"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|