Article View: sci.crypt
Article #592Depth of DES S-Boxes in "Gates"
From: Peter Wayner
Date: Tue, 14 Apr 1992 13:09
Date: Tue, 14 Apr 1992 13:09
18 lines
946 bytes
946 bytes
I remember a discussion not too long ago about the number of logic gates necessary to simulate the bits of the DES S-box. Someone observed that the DES S-boxes are more complex than random boxes. In this case the measure of complexity is the number of logic gates that it takes to simulate the result. Can anyone point me to a reference on this subject? Thanks, Peter Wayner (wayner@cs.cornell.edu) -- Peter Wayner Department of Computer Science Cornell Univ. Ithaca, NY 14850 EMail:wayner@cs.cornell.edu Office: 607-255-9202 or 255-1008 Home: 116 Oak Ave, Ithaca, NY 14850 Phone: 607-277-6678
Technical Details
Message-ID:
<1992Apr14.130906.15514@cs.cornell.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!batcomputer!cornell!waynerShow Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!batcomputer!cornell!wayner From: wayner@cs.cornell.edu (Peter Wayner) Subject: Depth of DES S-Boxes in "Gates" Message-ID: <1992Apr14.130906.15514@cs.cornell.edu> Organization: Cornell Univ. CS Dept, Ithaca NY 14853 Date: Tue, 14 Apr 1992 13:09:06 GMT Lines: 19