Abstract
A multivalued function is a function from a set \(E_{q}^{n}\) to a set E m , where E k is a set which contains k elements. These functions are used in cryptography: cipher design, hash function design and in theoretical computer science. In this paper, we study the representation of these functions with Multivalued Decision Diagrams (MDD). This representation can be used both to measure complexity and to implement efficiently the functions in hardware. We are especially interested in symmetric functions. We show that symmetric functions MDDs have much lower size than classical functions MDDs. One major result is to determine exactly their MDD’s maximum size. Notably, we highlight the links between De Bruijn sequences and the most complex symmetric functions and new functions are exhibited in the case q = 2 and any m. Enumeration of these functions are supplied, they are shown to be sufficiently numerous to allow many applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, G.E.: The theory of partitions. In: Encyclopedia of Mathematics and Its Applications, vol. 2. Addison-Wesley, Reading (1976)
Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak Sponge Function Family Main Document. Submission to NIST (Round 2) (2009)
Braeken, A., Lano, J., Mentens, N., Preneel, B., Verbauwhede, I.: SFINKS: a synchronous stream cipher for restricted hardware environments. In: Proceedings of SKEW—Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT. Aarhus, Denmark (2005)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C35 8, 677–691 (1986)
Bollig, B., Range, N., Wegener, I.: Exact OBDD Bounds for some Fundamental Functions. Electronic Colloquium on Computational Complexity, Report N° 49 (2007)
Butler, J.T., Herscovici, D.S., Sasao, T., Barton, R.J.: Average and worst case number of nodes in decision diagrams of symmetric multiple-valued functions. IEEE Trans. Comput. 46(4), 491–494 (1997)
Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inf. Theory 51(8), 2791–2811 (2005)
Heinrich-Litan, L., Molitor, P.: Least upper bounds for the size of OBDDs using symmetry properties. IEEE Trans. Comput. 49(4), 271–281 (2000)
Krause, M.: BDD-based cryptanalysis of keystream generators. In: Advances in Cryptology—EUROCRYPT 2002, LNCS 2332, pp. 222–237 (2002)
Michon, J.F., Valarcher, P., Yunes, J.B.: On Maximal QROBDD’s of Boolean functions. Theor. Inf. Appl. 9, 677–686 (2005)
Mouffron, M.: Transitive q-ary functions over finite fields or finite sets: counts, properties and applications. In: International Workshop on the Arithmetic of Finite Fields 2008, WAIFI 08, Siena, Italy, LNCS 5130, pp. 19–35 (2008)
Mouffron, M.: Balanced alternating and symmetric functions over finite sets. In: Workshop on Boolean Functions Cryptography and Applications (BFCA08), Copenhagen, Denmark, pp. 27–44 (2008)
Rosenfeld, V.R.: Enumerating De Bruijn sequences. MATCH Commun. Math. Comput. Chem. 45, 71–83 (2002)
Stegemann, D.: Extended BDD-based cryptanalysis of keystream generators. In: Proceedings of the 14th International Conference on Selected Areas in Cryptography (SAC’07), LNCS 4876, pp. 17–35 (2007)
Wegener, I.: Branching programs and binary decision diagrams—theory and applications. In: SIAM Monograph on Discrete Mathematics and Applications. ISBN 0-89871- 458-3 (2000)
Acknowledgements
We thank Boris Batteux for his computations on functions enumeration. We also thank the anonymous referees for excellent suggestions which greatly improved the clarity of this paper.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A: Algebraic degree distribution
These tables give the distribution of the algebraic degree of super hard symmetric functions and hard symmetric functions.
Appendix B: Maximum complexities of symmetric functions from \(E_2^n\) to E 2
This table gives the cardinal of the sets HSM n (q, m), SHSM n (q, m) and HSM n (q, m) ∩ SHSM n (q, m) for any n up to 35. The special cases n = a + 2a − 2 are in bold.
Appendix C: Number of balanced symmetric Boolean functions hard and super hard
This table gives the number of balanced hard and super hard symmetric Boolean functions for any odd n up to 53. There is no balanced hard nor super hard symmetric Boolean functions when n is even except 2 for n = 2.
Appendix D: Boolean symmetric functions’ complexity c R (f) distribution n = 1 to 33
Rights and permissions
About this article
Cite this article
Rovetta, C., Mouffron, M. De Bruijn sequences and complexity of symmetric functions. Cryptogr. Commun. 3, 207–225 (2011). https://doi.org/10.1007/s12095-011-0054-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-011-0054-2