{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T18:28:29Z","timestamp":1724610509015},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10623-012-9760-9","type":"journal-article","created":{"date-parts":[[2012,10,24]],"date-time":"2012-10-24T10:35:33Z","timestamp":1351074933000},"page":"249-264","source":"Crossref","is-referenced-by-count":44,"title":["Constructing differentially 4-uniform permutations over GF(22m ) from quadratic APN permutations over GF(22m+1)"],"prefix":"10.1007","volume":"72","author":[{"given":"Yongqiang","family":"Li","sequence":"first","affiliation":[]},{"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,25]]},"reference":[{"key":"9760_CR1","unstructured":"Beth T., Ding C.: On almost perfect nonlinear permutations. In: Advances in Cryptology\u2014EUROCRYPT\u201993. LNCS, vol. 765, pp. 65\u201376. Springer, New York (1994)."},{"issue":"1","key":"9760_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E. Biham","year":"1991","unstructured":"Biham E., Shamir A.: Defferential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3\u201372 (1991)","journal-title":"J. Cryptol."},{"issue":"4","key":"9760_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.ffa.2010.03.001","volume":"16","author":"C. Bracken","year":"2010","unstructured":"Bracken C., Leander G.: A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree. Finite Fields Appl. 16(4), 231\u2013242 (2010)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"9760_CR4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ffa.2007.11.002","volume":"14","author":"C. Bracken","year":"2008","unstructured":"Bracken C., Byrne E., Markin N., McGuire G.: New families of quadratic almost perfect nonlinear trinomials and multinomials. Finite Fields Appl. 14(3), 703\u2013714 (2008)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"9760_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12095-010-0038-7","volume":"3","author":"C. Bracken","year":"2011","unstructured":"Bracken C., Byrne E., Markin N., McGuire G.: A few more quadratic APN functions. Cryptogr. Commun. 3(1), 43\u201353 (2011)","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"9760_CR6","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.ffa.2011.11.006","volume":"18","author":"C. Bracken","year":"2012","unstructured":"Bracken C., Tan C.H., Tan Y.: Binomial differentially 4 uniform permutations with high nonlinearity. Finite Fields Appl. 18(3), 537\u2013546 (2012)","journal-title":"Finite Fields Appl."},{"issue":"1\u20134","key":"9760_CR7","first-page":"135","volume":"34","author":"K.A. Browning","year":"2009","unstructured":"Browning K.A., Dillon J.F., Kibler R.E., McQuistan M.T.: APN polynomials and related codes. J. Comb. Inf. Syst. Sci. 34(1\u20134), 135\u2013159 (2009)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"9760_CR8","unstructured":"Budaghyan L.: The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions. WAIFI 2007, LNCS 4547, pp. 177\u2013188. Springer, Heidelberg (2007)."},{"issue":"5","key":"9760_CR9","doi-asserted-by":"crossref","first-page":"2354","DOI":"10.1109\/TIT.2008.920246","volume":"54","author":"L. Budaghyan","year":"2008","unstructured":"Budaghyan L., Carlet C.: Classes of quadratic APN trinomials and hexanomials and related structures. IEEE Trans. Inf. Theory 54(5), 2354\u20132357 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9760_CR10","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1109\/TIT.2005.864481","volume":"52","author":"L. Budaghyan","year":"2006","unstructured":"Budaghyan L., Carlet C., Pott A.: New classes of almost bent and almost perfect nonlinear polynomials. IEEE Trans. Inf. Theory 52(3), 1141\u20131152 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"9760_CR11","doi-asserted-by":"crossref","first-page":"4218","DOI":"10.1109\/TIT.2008.928275","volume":"54","author":"L. Budaghyan","year":"2008","unstructured":"Budaghyan L., Carlet C., Leander G.: Two classes of quadratic APN binomials inequivalent to power functions. IEEE Trans. Inf. Theory 54(9), 4218\u20134229 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9760_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ffa.2008.10.001","volume":"15","author":"L. Budaghyan","year":"2009","unstructured":"Budaghyan L., Carlet C., Leander G.: Constructing new APN functions from known ones. Finite Fields Appl. 15(2), 150\u2013159 (2009)","journal-title":"Finite Fields Appl."},{"key":"9760_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1017\/CBO9780511780448.011","volume-title":"Chapter of the Monography \u201cBoolean Models and Methods in Mathematics, Computer Science, and Engineering\u201d","author":"C. Carlet","year":"2010","unstructured":"Carlet C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Chapter of the Monography \u201cBoolean Models and Methods in Mathematics, Computer Science, and Engineering\u201d, pp. 257\u2013397. Cambridge University Press, Cambridge (2010)"},{"key":"9760_CR14","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1017\/CBO9780511780448.012","volume-title":"Chapter of the Monography \u201cBoolean Models and Methods in Mathematics, Computer Science, and Engineering\u201d","author":"C. Carlet","year":"2010","unstructured":"Carlet C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P.L. (eds.) Chapter of the Monography \u201cBoolean Models and Methods in Mathematics, Computer Science, and Engineering\u201d, pp. 398\u2013469. Cambridge University Press, Cambridge (2010)"},{"key":"9760_CR15","doi-asserted-by":"crossref","unstructured":"Carlet C.: On known and new differentially uniform functions. ACISP 1-15 (2011).","DOI":"10.1007\/978-3-642-22497-3_1"},{"issue":"2","key":"9760_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C. Carlet","year":"1998","unstructured":"Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations sutiable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125\u2013156 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"9760_CR17","unstructured":"Chabaud F., Vaudenay S.: Links between differential and linear cryptanalysis. In: Advances in Cryptology\u2014EUROCRYPT\u201994. LNCS, vol. 950, pp. 356\u2013365. Springer, New York (1995)."},{"key":"9760_CR18","unstructured":"Dillon J.F.: APN polynomials: An Update. In: International Conference on Fields and Applications Fq9, Dublin, Ireland (2009)."},{"issue":"2","key":"9760_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s002000050099","volume":"9","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin H.: One-to-one highly nonlinear power functions on GF(2 n ). Appl. Algebra Eng. Commun. Comput. 9(2), 139\u2013152 (1998)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9760_CR20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TIT.1968.1054106","volume":"14","author":"R. Gold","year":"1968","unstructured":"Gold R.: Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Trans. Inf. Theory 14, 154\u2013156 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9760_CR21","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/S0019-9958(71)90473-6","volume":"18","author":"T. Kasami","year":"1971","unstructured":"Kasami T.: The weight enumerators for several classes of subcodes of the second order binary Reed\u2013Muller codes. Inf. Control 18, 369\u2013394 (1971)","journal-title":"Inf. Control"},{"key":"9760_CR22","unstructured":"Knudsen L.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196\u2013211. Springer, Heidelberg (1995)."},{"issue":"3","key":"9760_CR23","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/18.54892","volume":"36","author":"G. Lachaud","year":"1990","unstructured":"Lachaud G., Wolfmann J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inf. Theory 36(3), 686\u2013692 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9760_CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10623-010-9406-8","volume":"58","author":"Y. Li","year":"2011","unstructured":"Li Y., Wang M.: On EA-equivalence of certain permutations to power mappings. Des. Codes Cryptogr. 58(3), 259\u2013269 (2011)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"9760_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s12095-011-0045-3","volume":"3","author":"Y. Li","year":"2011","unstructured":"Li Y., Wang M.: Permutation polynomials EA-equivalent to the inverse function over GF(2 n ). Cryptogr. Commun. 3(3), 175\u2013186 (2011)","journal-title":"Cryptogr. Commun."},{"key":"9760_CR26","unstructured":"Matsui M.: Linear cryptanalysis method for DES cipher. In: Advances in Cryptology\u2014EUROCRYPT\u201993. Lecture Notes in computer Science, vol. 765, pp. 386\u2013397. Springer, New York (1994)."},{"key":"9760_CR27","unstructured":"Nyberg K.: Differentially uniform mappings for cryptography. In: Advances in Cryptography\u2014 EUROCRYPT\u201993. LNCS, vol. 765, pp. 55\u201364. Springer, Berlin (1994)."},{"key":"9760_CR28","unstructured":"Nyberg K.: S-boxes and round functions with controllable linearity and differential uniformity. In: Proceedings of Fast Software Encryption 1994. Lecture Notes in Computer Science, vol. 1008, pp. 111\u2013130. Springer, Berlin (1995)."},{"issue":"3","key":"9760_CR29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10623-010-9365-0","volume":"57","author":"E. Pasalic","year":"2010","unstructured":"Pasalic E., Charpin P.: Some results concerning cryptographically significant mappings over GF(2 n ). Des. Codes Cryptogr. 57(3), 257\u2013269 (2010)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9760-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9760-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9760-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T23:28:11Z","timestamp":1562282891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9760-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,25]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9760"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9760-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,25]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-012-9760-9', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>1</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>2</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>