• DocumentCode
    314575
  • Title

    Construction of highly nonlinear injective S-boxes with application to CAST-like encryption algorithms

  • Author

    Youssef, A.M. ; Chen, Z.G. ; Tavares, S.E.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, Ont., Canada
  • Volume
    1
  • fYear
    1997
  • fDate
    25-28 May 1997
  • Firstpage
    330
  • Abstract
    We present two methods for constructing highly nonlinear injective S-boxes. Both of these methods, which are based on exponential sums, outperform previously proposed methods. In particular, we are able to obtain injective 8×32 S-boxes with nonlinearity equal to 80 and maximum XOR table entry of 2. We also reevaluate the resistance of the CAST like encryption algorithms constructed using randomly selected S-boxes to the basic linear cryptanalysis
  • Keywords
    approximation theory; computational complexity; cryptography; CAST like encryption algorithms; basic linear cryptanalysis; exponential sums; highly nonlinear injective S-box construction; maximum XOR table entry; nonlinearity; randomly selected S-boxes; Concatenated codes; Cryptography; Hamming distance; Polynomials; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 1997. Engineering Innovation: Voyage of Discovery. IEEE 1997 Canadian Conference on
  • Conference_Location
    St. Johns, Nfld.
  • ISSN
    0840-7789
  • Print_ISBN
    0-7803-3716-6
  • Type

    conf

  • DOI
    10.1109/CCECE.1997.614856
  • Filename
    614856