Advertisement

EUROCRYPT 1982: Cryptography pp 257-262 | Cite as

Are Big S-Boxes Best?

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 149)

Abstract

Various probabilities of accidental linearities occurring in a random, reversible substitution lookup table (S-box) with m address and m contents bits are calculated. These probabilities decrease very dramatically with increasing m. It is conjectured that good S-boxes may be built by choosing a random, reversible table of sufficient size.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Federal Information Processing Standard Publication no 46. Department of Commerce. National Bureau of Standards, Gaithersburg, Md, USA.Google Scholar
  2. [2]
    Shannon, C.E. “A Mathematical theory of Secrecy System” Bell System Technical Journal 1948.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  1. 1.Hatfield PolytechnicEngland

Personalised recommendations