{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:28:21Z","timestamp":1757312901779},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,8,6]],"date-time":"2011-08-06T00:00:00Z","timestamp":1312588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s12095-011-0054-2","type":"journal-article","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T07:04:22Z","timestamp":1312527862000},"page":"207-225","source":"Crossref","is-referenced-by-count":8,"title":["De Bruijn sequences and complexity of symmetric functions"],"prefix":"10.1007","volume":"3","author":[{"given":"Christelle","family":"Rovetta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Mouffron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,6]]},"reference":[{"key":"54_CR1","volume-title":"Encyclopedia of Mathematics and Its Applications, vol. 2","author":"GE Andrews","year":"1976","unstructured":"Andrews, G.E.: The theory of partitions. In: Encyclopedia of Mathematics and Its Applications, vol. 2. Addison-Wesley, Reading (1976)"},{"key":"54_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak Sponge Function Family Main Document. Submission to NIST (Round 2) (2009)"},{"key":"54_CR3","unstructured":"Braeken, A., Lano, J., Mentens, N., Preneel, B., Verbauwhede, I.: SFINKS: a synchronous stream cipher for restricted hardware environments. In: Proceedings of SKEW\u2014Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT. Aarhus, Denmark (2005)"},{"key":"54_CR4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"8","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C35 8, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput. C35"},{"key":"54_CR5","unstructured":"Bollig, B., Range, N., Wegener, I.: Exact OBDD Bounds for some Fundamental Functions. Electronic Colloquium on Computational Complexity, Report N\u00b0 49 (2007)"},{"issue":"4","key":"54_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/12.588065","volume":"46","author":"JT Butler","year":"1997","unstructured":"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\u2013494 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"54_CR7","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1109\/TIT.2005.851743","volume":"51","author":"A Canteaut","year":"2005","unstructured":"Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inf. Theory 51(8), 2791\u20132811 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"54_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/12.844348","volume":"49","author":"L Heinrich-Litan","year":"2000","unstructured":"Heinrich-Litan, L., Molitor, P.: Least upper bounds for the size of OBDDs using symmetry properties. IEEE Trans. Comput. 49(4), 271\u2013281 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Krause, M.: BDD-based cryptanalysis of keystream generators. In: Advances in Cryptology\u2014EUROCRYPT 2002, LNCS 2332, pp. 222\u2013237 (2002)","DOI":"10.1007\/3-540-46035-7_15"},{"key":"54_CR10","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1051\/ita:2005036","volume":"9","author":"JF Michon","year":"2005","unstructured":"Michon, J.F., Valarcher, P., Yunes, J.B.: On Maximal QROBDD\u2019s of Boolean functions. Theor. Inf. Appl. 9, 677\u2013686 (2005)","journal-title":"Theor. Inf. Appl."},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"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\u201335 (2008)","DOI":"10.1007\/978-3-540-69499-1_3"},{"key":"54_CR12","unstructured":"Mouffron, M.: Balanced alternating and symmetric functions over finite sets. In: Workshop on Boolean Functions Cryptography and Applications (BFCA08), Copenhagen, Denmark, pp. 27\u201344 (2008)"},{"key":"54_CR13","first-page":"71","volume":"45","author":"VR Rosenfeld","year":"2002","unstructured":"Rosenfeld, V.R.: Enumerating De Bruijn sequences. MATCH Commun. Math. Comput. Chem. 45, 71\u201383 (2002)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Stegemann, D.: Extended BDD-based cryptanalysis of keystream generators. In: Proceedings of the 14th International Conference on Selected Areas in Cryptography (SAC\u201907), LNCS 4876, pp. 17\u201335 (2007)","DOI":"10.1007\/978-3-540-77360-3_2"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams\u2014theory and applications. In: SIAM Monograph on Discrete Mathematics and Applications. ISBN 0-89871- 458-3 (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-011-0054-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-011-0054-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-011-0054-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T16:21:42Z","timestamp":1560442902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-011-0054-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,6]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s12095-011-0054-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,6]]}}}