Some cryptographic properties of exponential functions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 917)
Some cryptographic properties such as linear structure, SAC and nonlinearity of Exponential boolean functions and permutations on GF(2)n are studied in this paper.
Keywordsexponential permutation linear structure SAC nonlinearity
Unable to display preview. Download preview PDF.
- 1.Tor Helleseth, Some Results about the Cross-Correlation Function between Two Maximal Linear Sequences, Discrete Mathematics, Vol. 16, 1976, pp. 209–232.Google Scholar
- 2.Y.Niho, Multi-values Cross-Correlation Function between Two Maximal Linear Recursive Sequences, Ph.D. Dissertation, Univ. of Southern California, Los Angeles, CA(1972).Google Scholar
- 3.K.Nyberg, Differentially Uniform Mappings for Cryptography, Lecture Notes in Computer Science, Advances in Cryptology, Proceedings of EUROCRYPT'93, 1993.Google Scholar
- 4.Josef P.Pieprzyk, Non-Linearity of Exponent Permutations, Lecture Notes in Computer Science, Advances in Cryptology, Proceedings of EUROCRYPT'89, pp.80–92, 1989.Google Scholar
- 5.J.Seberry, X.M.Zhang, and Y.Zheng, Structure of cryptographic functions with strong avalanche characteristics, Pre-proceedings of AISACRYPT'94, pp.96–106.Google Scholar
- 6.M.K.Simmon, J.K.Omura, R.A.Scholtz, B.K.Levitt, Spread Spectrum Communication, Vol.I, Computer Science Press, Inc., 1985, Chapter 5.Google Scholar
- 7.A.F.Webster and S.E.Tavares, On the design of S-boxes, Lecture Notes in Computer Science 219, Advances in Cryptology, Proceedings of CRYPTO'85, pp.523–534, 1986.Google Scholar
© Springer-Verlag Berlin Heidelberg 1995