From: mkwan@preston.net (Matthew Kwan)
To: cypherpunks@toad.com
Message Hash: 15496be0c162143e2db674d8a9793a87f087b68b3a00d6364b6b7c41e69b9448
Message ID: <199803042313.KAA10987@preston-gw.preston.net>
Reply To: N/A
UTC Datetime: 1998-03-04 23:13:35 UTC
Raw Date: Wed, 4 Mar 1998 15:13:35 -0800 (PST)
From: mkwan@preston.net (Matthew Kwan)
Date: Wed, 4 Mar 1998 15:13:35 -0800 (PST)
To: cypherpunks@toad.com
Subject: DES bitslice S-boxes
Message-ID: <199803042313.KAA10987@preston-gw.preston.net>
MIME-Version: 1.0
Content-Type: text/plain
I've been a bit out of touch with the subject for a while, so could
someone please bring me up to speed in the state of the art of DES
bitslice. In particular, what are the best gate counts for the S-boxes?
About a year ago I produced S-boxes with the following counts
S-box S1 S2 S3 S4 S5 S6 S7 S8
Gates 95 84 89 77 96 87 86 88
(You can download them from http://www.cs.mu.oz.au/~mkwan/bitslice)
However, I was recently told that these have now been beaten by a
significant margin. I thought about it for a while, and came up with
some ideas that should improve the count, but I'd like to know what
I'm aiming for.
Any improvements I make will also be made freely available, so you
have an incentive to help me ;-)
mkwan
Return to March 1998
Return to “mkwan@preston.net (Matthew Kwan)”
1998-03-04 (Wed, 4 Mar 1998 15:13:35 -0800 (PST)) - DES bitslice S-boxes - mkwan@preston.net (Matthew Kwan)