|
Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com |
Subject: Re: AES as a hash function?
From: Jim Gillogly (jim
acm.org)Date: Mon Oct 02 2000 - 18:32:53 CDT
- Next message: Bill Stewart: "Re: one time pad and random num gen"
- Previous message: John Young: "Re: AES winner?"
- In reply to: Bram Cohen: "AES as a hash function?"
- Next in thread: Paulo S. L. M. Barreto: "Re: AES as a hash function?"
- Reply: Jim Gillogly: "Re: AES as a hash function?"
- Reply: Paulo S. L. M. Barreto: "Re: AES as a hash function?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Bram Cohen wrote:
>
> The announcement didn't mention Rijndael's applicability as a hash
> function. I thing I remember mention in earlier AES documents that it
This is covered in the materials submitted by the Rijndael team,
in the Algorithm Specification at
http://csrc.nist.gov/encryption/aes/round2/r2algs.htm
in section 13.
> UHASH is also strictly 128-bit, it would be nice for there to be 256-bit,
> 384-bit, and 512-bit versions as well, to keep parity with the AES.
I expect SHA variants of these lengths to be available before long
from NSA via NIST.
-- Jim Gillogly Trewesday, 11 Winterfilth S.R. 2000, 23:28 12.19.7.10.15, 11 Men 18 Chen, Eighth Lord of Night
- Next message: Bill Stewart: "Re: one time pad and random num gen"
- Previous message: John Young: "Re: AES winner?"
- In reply to: Bram Cohen: "AES as a hash function?"
- Next in thread: Paulo S. L. M. Barreto: "Re: AES as a hash function?"
- Reply: Jim Gillogly: "Re: AES as a hash function?"
- Reply: Paulo S. L. M. Barreto: "Re: AES as a hash function?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]