Abstract
In this contribution we consider the stability of linearity and differential uniformity of vector Boolean functions under certain constructions and modifications. These include compositions with affine surjections onto the input space and with affine surjections from the output space, inversions, adding coordinate functions, forming direct sums and restrictions to affine subspaces. As examples we consider some true round function and S-box constructions. More theoretical examples are offered by the bent and almost perfect nonlinear functions. We also include some facts about functions with partially bent components.
Sponsored by the Matine Board, Finland
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. Adams and S. E. Tavares, The structured design of cryptographically good S-boxes, Journal of Cryptology 3, 1, 1990, pp. 27–42.
C. Adams and S. E. Tavares, Designing S-boxes for ciphers resistant to differential cryptanalysis, Proceedings of SPRC'93, Fondazione Ugo Bordoni, 1993.
M. Blaze and B. Schneier, The MacGuffin block cipher algorithm, these proceedings, pp. 97–110.
C. Carlet, Partially-bent functions, Advances in Cryptology — CRYPTO'92, Lecture Notes in Computer Science, Springer-Verlag, 1993.
F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis, Proceedings of Eurocrypt'94 (to appear).
J. Daemen, Correlation matrices, these proceedings, pp. 275–285.
H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, these proceedings, pp. 61–74.
H. M. Heys and S. E. Tavares, On the security of the CAST encryption algorithm, to appear in the proceedings of Canadian Conference on Computer and Electrical Engineering, Halifax, September 1994.
H. M. Heys and S. E. Tavares, Substitution-permutation networks resistant to differential and linear cryptanalysis, 2nd ACM CCCS, Fairfax, Virginia, November 1994.
T. Kasami, Weight enumerators for several classes of the 2nd order binary Reed-Muller codes, Information and Control 18, 1971.
L. Ramkilde Knudsen, Block ciphers — analysis, design and applications, Ph.D. thesis, DAIMI PB — 485, November 1994.
R. Lidl and H. Niederreiter, “Finite Fields”, Encyclopedia of Mathematics and its applications 20, Addison-Wesley, Reading, Massachusetts, 1983.
W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology — EUROCRYPT'89, Lecture Notes in Computer Science, Springer-Verlag (1990), pp. 549–562.
K. Nyberg, Perfect nonlinear S-boxes, Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science 547, Springer-Verlag (1991), pp. 378–385.
K. Nyberg, On the construction of highly nonlinear permutations, Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science 658, Springer-Verlag (1993), pp. 92–98.
K. Nyberg, Differentially uniform mappings for cryptography, Advances in Cryptology — EUROCRYPT '93, Lecture Notes in Computer Science 765, Springer-Verlag (1994), pp. 55–64.
K. Nyberg, Linear approximation of block ciphers, Proceedings of Eurocrypt'94 (to appear).
K. Nyberg and L. R. Knudsen, Provable security against a differential attack, to appear in J. Crypt. 8, No. 1, 1995 (preliminary version: Proven security against differential cryptanalysis, Proceedings of Crypto'92).
N. J. Patterson and D. H. Wiedemann, The covering radius of the (215, 16) Reed-Müller code it at least 16276, IEEE Trans. on Information Theory 29 (1983), pp. 354–356.
V. Rijmen and B. Preneel, Cryptanalysis of MacGuffin, these proceedings, pp. 353–358.
J. Seberry, X.-M. Zhang and Y. Zheng, Nonlinearity and probagation characteristics of balanced Boolean functions, Information and Computation (to appear).
J. Seberry, X.-M. Zhang and Y. Zheng, Nonlinearity characteristics of quadratic substitution boxes, Proceedings of the Workshop on Selected Areas in Cryptography (SAC '94), May 5–6, 1994, Kingston, Canada. To appear under the title Relationships among nonlinearity criteria in the proceedings of EUROCRYPT'94.
J. Seberry, X.-M. Zhang and Y. Zheng, Pitfalls in designing substitution boxes, Advances in Cryptology — CRYPTO'94, Lecture Notes in Computer Science 839, Springer-Verlag (1994), pp. 383–396.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, K. (1995). S-boxes and round functions with controllable linearity and differential uniformity. In: Preneel, B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60590-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-60590-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60590-4
Online ISBN: 978-3-540-47809-6
eBook Packages: Springer Book Archive