Abstract.
In this paper a new general methodology is developed to construct Boolean permutations such that any non-trivial linear combination of their components has the largest algebraic degree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Fast Software Encrytion, Vol 1267 of Lecture notes in Computer Science, Springer-Verlag, 1997, pp. 28–40
Satoh, T., Wata, T., Kursawa, K.: On cryptographically secure vectorial Boolean functions. In: proceedings of ASIACRYPT’99 [A], Springer-Verlag, Berlin, Germany, 1999, pp. 62–74
Williams, F.J.M., Slone, N.J.A.: The theory of error correcting codes, North Holland 1977
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Natural Science Foundation of China no.90304007
Acknowledgement The authors would like to express their deep gratitude to the anonymous referees for their valuable comments on this short paper.
Rights and permissions
About this article
Cite this article
Zhang, W., Wu, CK. & Li, S. Construction of Cryptographically Important Boolean Permutations. AAECC 15, 173–177 (2004). https://doi.org/10.1007/s00200-004-0163-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-004-0163-7