Messages in this thread | | | Date | Mon, 9 Aug 2004 13:20:32 -0700 (PDT) | From | dean gaudet <> | Subject | Re: AES assembler optimizations |
| |
On Mon, 9 Aug 2004, Bob Deblier wrote:
> On Mon, 2004-08-09 at 16:28, Andi Kleen wrote: > > Bob Deblier <bob.deblier@telenet.be> writes: > > > > > Just picked up on KernelTrap that there were some problems with > > > optimized AES code; if you wish, I can provide my own LGPL licensed (or > > > I can relicense them for you under GPL), as included in the BeeCrypt > > > Cryptography Library. > > > > > > I have generic i586 code and SSE-optimized code available in GNU > > > assembler format. Latest version is always available on SourceForge > > > (http://sourceforge.net/cvs/?group_id=8924). > > > > Would be interesting. Do you have any benchmarks for your code? > > BeeCrypt contains benchmarks in the 'tests' subdirectory. Running of > 'make bench' will execute them. Benchmarks results below for repeatedly > looping over the same 16K block, produced by 'benchbc', without any > tweaks (YMMV): > > P4 2400, with MMX: > ECB encrypted 738304 KB in 10.00 seconds = 73823.02 KB/s
the gladman code achieves ~88MB/s for p4 northwood 2.4GHz... without using mmx.
it looks like your mmx code is 1-2% faster on p-m compared to the gladman code though -- nice, just a half hour ago i posted wondering if anyone had taken advantage of the 1 cycle mmx on the p2/p3/p-m processors for doing the AES XOR steps... and that's what your code does.
unfortunately i don't think that pays off compared to the gladman code on other x86 processors.
-dean - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |