{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:00:59Z","timestamp":1769522459283,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1008337029047","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"121-149","source":"Crossref","is-referenced-by-count":24,"title":["Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography"],"prefix":"10.1007","volume":"16","author":[{"given":"Paul","family":"Camion","sequence":"first","affiliation":[]},{"given":"Anne","family":"Canteaut","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"195205_CR1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C.H. Bennett","year":"1988","unstructured":"C.H. Bennett, G. Brassard and J.-M. Robert, Privacy amplification by public discussion. SIAM J. Computing, Vol. 17,No. 2 (1988) pp. 210-229.","journal-title":"SIAM J. Computing"},{"key":"195205_CR2","unstructured":"E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill (1968)."},{"key":"195205_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-48658-5_24","volume-title":"Advances in Cryptology \u2014 CRYPTO'94","author":"J. Bierbrauer","year":"1994","unstructured":"J. Bierbrauer, K. Gopalakrishnan and D.R. Stinson, Bounds for resilient functions and orthogonal arrays, Advances in Cryptology \u2014 CRYPTO'94 (Y.G. Desmedt, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 839 (1994) pp. 247-256."},{"key":"195205_CR4","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A.E. Brouwer","year":"1993","unstructured":"A.E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Transactions on Information Theory, Vol. 39 (1993) pp. 662-677. Also available on http:\/\/www.win.tue.nl\/math\/dw\/voorlincod.html.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-39805-8_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT '85","author":"L. Brynielsson","year":"1986","unstructured":"L. Brynielsson, On the linear complexity of combined shift register sequences. Advances in Cryptology \u2014 EUROCRYPT '85 (F. Pichler, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 219 (1986) pp. 156-160."},{"issue":"6","key":"195205_CR6","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/18.45299","volume":"35","author":"L. Brynielsson","year":"1989","unstructured":"L. Brynielsson, A short proof of the Xiao-Massey lemma, IEEE Transactions on Information Theory, 35(6):1344, 1989.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68339-9_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT'96","author":"P. Camion","year":"1996","unstructured":"P. Camion and A. Canteaut, Construction of t-resilient functions over a finite alphabet. Advances in Cryptology \u2014 EUROCRYPT'96 (U. Maurer, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1070 (1996) pp. 283-293."},{"key":"195205_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2014 CRYPTO'96","author":"P. Camion","year":"1996","unstructured":"P. Camion and A. Canteaut, Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations, Advances in Cryptology \u2014 CRYPTO'96 (N. Koblitz, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1109 (1996)."},{"key":"195205_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-46766-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO'91","author":"P. Camion","year":"1992","unstructured":"P. Camion, C. Carlet, P. Charpin and N. Sendrier, On correlation-immune functions, Advances in Cryptology \u2014 CRYPTO'91 (J. Feigenbaum, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 576 (1992) pp. 86-100."},{"key":"195205_CR10","volume-title":"Attaques de cryptosyst\u00e8mes \u00e0 mots de poids faible et construction de fonctions t-r\u00e9silientes","author":"A. Canteaut","year":"1996","unstructured":"A. Canteaut, Attaques de cryptosyst\u00e8mes \u00e0 mots de poids faible et construction de fonctions t-r\u00e9silientes, PhD thesis, Universit\u00e9 Paris VI, France (1996)."},{"key":"195205_CR11","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. Hastad, J. Freidmann, S. Rudich and R. Smolensky, The bit extraction problem or t-resilient functions, Proc. 26th IEEE Symposium on Foundations of Computer Science (1985) pp. 396-407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"195205_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"The block cipher SQUARE, Fast Software Encryption","author":"J. Daemen","year":"1997","unstructured":"J. Daemen, L. Knudsen and V. Rijmen, The block cipher SQUARE, Fast Software Encryption (E. Biham, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1267 (1997)."},{"key":"195205_CR13","first-page":"272","volume":"27","author":"P. Delsarte","year":"1972","unstructured":"P. Delsarte, Bounds for unrestricted codes, by linear programming, Philips Research Reports, Vol. 27 (1972) pp. 272-289.","journal-title":"Philips Research Reports"},{"key":"195205_CR14","volume-title":"An algebraic approach to the association schemes of coding theory","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte, An algebraic approach to the association schemes of coding theory, PhD thesis, Universit\u00e9 catholique de Louvain, Belgium (1973)."},{"issue":"5","key":"195205_CR15","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte, Four fundamental parameters of a code and their combinatorial signifiance, Information and Control, Vol. 23,No. 5 (1973) pp. 407-438.","journal-title":"Information and Control"},{"key":"195205_CR16","volume-title":"Concatenated codes","author":"G.D. Forney Jr","year":"1966","unstructured":"G.D. Forney, Jr, Concatenated codes, The MIT Press, Cambridge, MA (1966)."},{"issue":"1","key":"195205_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/18.42178","volume":"IT-35","author":"J. D. Goli\u0107","year":"1989","unstructured":"J. DJ. Goli\u0107, On the linear complexity of functions of periodic GF(q) sequences, IEEE Transactions on Information Theory, Vol. IT-35,No. 1 (1989) pp. 69-75.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01388386","volume":"5","author":"K. Gopalakrishnan","year":"1995","unstructured":"K. Gopalakrishnan and D.R. Stinson, Three characterizations of non-binary correlation-immune and resilient functions, Designs, Codes and Cryptography, Vol. 5 (1995) pp. 241-251.","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"195205_CR19","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1006\/ffta.1995.1016","volume":"1","author":"R. G\u00f6ttfert","year":"1995","unstructured":"R. G\u00f6ttfert and H. Niederreiter, On the minimal polynomial of the product of linear recurring sequences, Finite Fields and Their Applications, Vol. 1,No. 2 (1995) pp. 204-218.","journal-title":"Finite Fields and Their Applications"},{"key":"195205_CR20","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2140\/pjm.1955.5.541","volume":"5","author":"M. Hall","year":"1955","unstructured":"M. Hall and L.J. Paige, Complete mappings of finite groups, Pacific Journal of Mathematics, Vol. 5 (1955) pp. 541-549.","journal-title":"Pacific Journal of Mathematics"},{"key":"195205_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-39805-8_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT '85","author":"T. Herlestam","year":"1986","unstructured":"T. Herlestam, On functions of linear shift register sequences, Advances in Cryptology \u2014 EUROCRYPT '85 (F. Pichler, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 219 (1986) pp. 119-129."},{"key":"195205_CR22","unstructured":"R. Lidl and H. Niederreiter, Finite fields. Cambridge University Press (1983)."},{"key":"195205_CR23","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"J.L. Massey, Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, Vol. 15 (1969) pp. 122-127.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR24","volume-title":"Provable security in cryptography","author":"U.M. Maurer","year":"1990","unstructured":"U.M. Maurer, Provable security in cryptography, PhD thesis, ETH Z\u00fcrich, Switzerland (1990)."},{"key":"195205_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/0-387-34805-0_11","volume-title":"Advances in Cryptology \u2014 CRYPTO'89","author":"U.M. Maurer","year":"1990","unstructured":"U.M. Maurer and J.L. Massey, Perfect local randomness in pseudo-random sequences, Advances in Cryptology \u2014 CRYPTO'89 (G. Brassard, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 435 (1990) pp. 100-112."},{"key":"195205_CR26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00196773","volume":"4","author":"U.M. Maurer","year":"1991","unstructured":"U.M. Maurer and J.L. Massey, Local randomness in pseudorandom sequences, Journal of Cryptology, Vol. 4 (1991) pp. 135-149.","journal-title":"Journal of Cryptology"},{"key":"195205_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-46885-4_53","volume-title":"Advances in Cryptology \u2014 EUROCRYPT'89","author":"W. Meier","year":"1990","unstructured":"W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology \u2014 EUROCRYPT'89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science, Springer-Verlag, New York, 434 (1990) pp. 549-562."},{"key":"195205_CR28","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/2983576","volume":"9","author":"C.R. Rao","year":"1947","unstructured":"C.R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Roy. Statist., Vol. 9 (1947) pp. 128-139.","journal-title":"J. Roy. Statist."},{"key":"195205_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","author":"V. Rijmen","year":"1996","unstructured":"V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers and E. De Win, The cipher SHARK, Fast Software Encryption (D. Gollmann, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1039 (1996)."},{"key":"195205_CR30","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O.S. Rothaus","year":"1976","unstructured":"O.S. Rothaus. On bent functions. Journal of combinatorial Theory (A), 20:300-305, 1976.","journal-title":"Journal of combinatorial Theory (A)"},{"issue":"1","key":"195205_CR31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TIT.1987.1057268","volume":"33","author":"R.A. Rueppel","year":"1987","unstructured":"R.A. Rueppel and O.J. Staffelbach, Products of linear recurring sequences with maximum complexity, IEEE Transactions on Information Theory, Vol. 33,No. 1 (1987) pp. 124-131.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BFb0053423","volume-title":"Advances in Cryptology \u2014 EUROCRYPT'94","author":"C.-P. Schnorr","year":"1995","unstructured":"C.-P. Schnorr and S. Vaudenay, Black box cryptanalysis of hash networks based on multipermutations, Advances in Cryptology \u2014 EUROCRYPT'94 (A. De Santis, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 950 (1995) pp. 47-57."},{"key":"195205_CR33","volume-title":"Linear recurrence relations over finite fields","author":"E.S. Selmer","year":"1966","unstructured":"E.S. Selmer, Linear recurrence relations over finite fields, PhD thesis, University of Bergen, Norway (1966)."},{"key":"195205_CR34","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28 (1949) pp. 656-715.","journal-title":"Bell System Technical Journal"},{"issue":"5","key":"195205_CR35","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"IT-30","author":"T. Siegenthaler","year":"1984","unstructured":"T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, Vol. IT-30,No. 5 (1984) pp. 776-780.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"195205_CR36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TC.1985.1676518","volume":"C-34","author":"T. Siegenthaler","year":"1985","unstructured":"T. Siegenthaler, Decrypting a class of stream ciphers using ciphertext only, IEEE Transactions on Computers, Vol. C-34,No. 1 (1985) pp. 81-84.","journal-title":"IEEE Transactions on Computers"},{"key":"195205_CR37","first-page":"105","volume":"92","author":"D.R. Stinson","year":"1993","unstructured":"D.R. Stinson, Resilient functions and large sets of orthogonal arrays, Congressus Numer., Vol. 92 (1993) pp. 105-110.","journal-title":"Congressus Numer."},{"issue":"3","key":"195205_CR38","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"D.R. Stinson","year":"1995","unstructured":"D.R. Stinson and J.L. Massey, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, Journal of Cryptology, Vol. 8,No. 3 (1995) pp. 167-173.","journal-title":"Journal of Cryptology"},{"key":"195205_CR39","volume-title":"La s\u00e9curit\u00e9 des primitives cryptographiques","author":"S. Vaudenay","year":"1995","unstructured":"S. Vaudenay, La s\u00e9curit\u00e9 des primitives cryptographiques, PhD thesis, Universit\u00e9 Paris 7, France (1995)."},{"key":"195205_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-60590-8_22","volume-title":"Fast Software Encryption","author":"S. Vaudenay","year":"1995","unstructured":"S. Vaudenay, On the need for multipermutations: cryptanalysis of MD4 and SAFER, Fast Software Encryption (B. Preneel, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1008 (1995) pp. 286-297."},{"issue":"3","key":"195205_CR41","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.6037","volume":"IT-34","author":"G. Xiao","year":"1988","unstructured":"G. Xiao and J.L. Massey, A spectral characterization of correlation-immune combining functions, IEEE Transactions on Information Theory, Vol. IT-34,No. 3 (1988) pp. 569-571.","journal-title":"IEEE Transactions on Information Theory"},{"key":"195205_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-49264-X_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT'95","author":"X. Zhang","year":"1995","unstructured":"X. Zhang and Y. Zheng, On nonlinear resilient functions, Advances in Cryptology \u2014 EUROCRYPT'95 (L. Guillou and J.J. Quisquater, ed.) Lecture Notes in Computer Science, Springer-Verlag, New York, 921 (1995) pp. 274-288."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008337029047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008337029047\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008337029047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:32:55Z","timestamp":1753759975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008337029047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["195205"],"URL":"https:\/\/doi.org\/10.1023\/a:1008337029047","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}