Re: Release 1.1 (beta) of my AES implementation
From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 06/25/03
- Next message: Marin: "Re: Random ID numbers...32 bit version of DES...possible?"
- Previous message: Tom St Denis: "Re: Release 1.1 (beta) of my AES implementation"
- In reply to: Marin: "Re: Release 1.1 (beta) of my AES implementation"
- Next in thread: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- Reply: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 25 Jun 2003 16:15:44 GMT
Marin wrote:
>
> Tom St Denis wrote:
> > I still would wave flags at your unions. Not only because I don't
> > trust it but because it honestly is *NOT* faster. When I was porting
> > Rijmen's code to LTC I experimented with various things like that.
>
> Maybe I'm pointing out something you knew anyway, but unions are for
> reducing memory requirements, not for faster code. Computers have so
> much memory these days that most programmers don't bother using them
> anymore.
I knew that. But in this case he is not reducing memory. He is trying
to errnoeously avoid shifting.
[BTW I use unions in LTC, my god people check out my code for three
seconds before commenting on it!]
Tom
- Next message: Marin: "Re: Random ID numbers...32 bit version of DES...possible?"
- Previous message: Tom St Denis: "Re: Release 1.1 (beta) of my AES implementation"
- In reply to: Marin: "Re: Release 1.1 (beta) of my AES implementation"
- Next in thread: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- Reply: Mok-Kong Shen: "Re: Release 1.1 (beta) of my AES implementation"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|