{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T19:12:26Z","timestamp":1760987546929,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["247742\/O70"],"award-info":[{"award-number":["247742\/O70"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["314395"],"award-info":[{"award-number":["314395"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s12095-022-00600-8","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T08:02:40Z","timestamp":1658131360000},"page":"199-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On decompositions of permutation polynomials into quadratic and cubic power permutations"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1125-4343","authenticated-orcid":false,"given":"George","family":"Petrides","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,18]]},"reference":[{"key":"600_CR1","doi-asserted-by":"publisher","unstructured":"Carlet, C., Goubin, L., Prouff, E., Quisquater, M., Rivain, M.: Higher-order masking schemes for s-boxes. In: Proceedings of FSE, LNCS, vol. 7549, pp 366\u2013384 (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_21","DOI":"10.1007\/978-3-642-34047-5_21"},{"key":"600_CR2","doi-asserted-by":"publisher","unstructured":"Carlet, C., Prouff, E.: Polynomial evaluation and side channel analysis. In: The New Codebreakers, LNCS, vol. 9100, pp 315\u2013341 (2016). https:\/\/doi.org\/10.1007\/978-3-662-49301-4_20","DOI":"10.1007\/978-3-662-49301-4_20"},{"key":"600_CR3","doi-asserted-by":"publisher","unstructured":"Carlet, C., Prouff, E., Rivain, M., Roche, T.: Algebraic decomposition for probing security. In: Proceedings of CRYPTO, LNCS, vol. 9215, pp 742\u2013763 (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_36","DOI":"10.1007\/978-3-662-47989-6_36"},{"key":"600_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1090\/S0002-9939-1953-0055965-8","volume":"4","author":"L Carlitz","year":"1953","unstructured":"Carlitz, L.: Permutations in a finite field. Proc. Amer. Math. Soc. 4, 538 (1953)","journal-title":"Proc. Amer. Math. Soc."},{"key":"600_CR5","doi-asserted-by":"publisher","unstructured":"Coron, J.S., Roy, A., Vivek, S.: Fast evaluation of polynomials over finite fields and application to side-channel countermeasures, vol. 8731, pp 170\u2013187 (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_10","DOI":"10.1007\/978-3-662-44709-3_10"},{"key":"600_CR6","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. vol 20, Cambridge University press (1997)","DOI":"10.1017\/CBO9780511525926"},{"key":"600_CR7","doi-asserted-by":"publisher","unstructured":"McEliece, R.: Crosscorrelation properties of m-sequences. In: Finite fields for computer scientists and engineers, vol. 23. https:\/\/doi.org\/10.1007\/978-1-4613-1983-2_11 (1987)","DOI":"10.1007\/978-1-4613-1983-2_11"},{"key":"600_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4064\/aa-80-3-197-212","volume":"3","author":"P Moree","year":"1997","unstructured":"Moree, P.: On the divisors of ak + bk. ACTA ARITHMETICA LXXX. 3, 197\u2013212 (1997). https:\/\/doi.org\/10.4064\/aa-80-3-197-212","journal-title":"ACTA ARITHMETICA LXXX."},{"key":"600_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12095-018-0317-2","volume":"11","author":"S Nikova","year":"2019","unstructured":"Nikova, S., Nikov, V., Rijmen, V.: Decomposition of permutations in a finite field. Cryptogr. Commun. 11, 37\u201341 (2019). https:\/\/doi.org\/10.1007\/s12095-018-0317-2","journal-title":"Cryptogr. Commun."},{"key":"600_CR10","doi-asserted-by":"publisher","unstructured":"Nikova, S., Rechberger, C., Rijmen, V.: Threshold implementations against side-channel attacks and glitches. In: Proceedings of ICICS, LNCS, vol. 4307, pp 529\u2013545 (2006). https:\/\/doi.org\/10.1007\/11935308_38","DOI":"10.1007\/11935308_38"},{"key":"600_CR11","doi-asserted-by":"publisher","unstructured":"Otal, K., Tekin, E.: Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials. Cryptogr Commun\u00a0(2021). https:\/\/doi.org\/10.1007\/s12095-021-00512-z","DOI":"10.1007\/s12095-021-00512-z"},{"key":"600_CR12","doi-asserted-by":"publisher","unstructured":"Petrides, G.: On non-completeness in threshold implementations. In: Proceedings of ACM Workshop TIS@CCS 2019, pp 24\u201328 (2019). https:\/\/doi.org\/10.1145\/3338467.3358951","DOI":"10.1145\/3338467.3358951"},{"key":"600_CR13","doi-asserted-by":"publisher","unstructured":"Petrides, G.: A number theoretic view on binary shift registers. Cryptogr and Comm\u00a0(2022). https:\/\/doi.org\/10.1007\/s12095-022-00562-x","DOI":"10.1007\/s12095-022-00562-x"},{"key":"600_CR14","doi-asserted-by":"publisher","unstructured":"Roy, A., Vivek, S.: Analysis and improvement of the generic higher-order masking scheme of FSE 2012. In: Proceedings of CHES, LNCS, vol. 8086, pp 417\u2013434 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_24","DOI":"10.1007\/978-3-642-40349-1_24"},{"issue":"2","key":"600_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539798344112","volume":"29","author":"F Ruskey","year":"1999","unstructured":"Ruskey, F., Sawada, J.: An efficient algorithm for generating necklaces with fixed density. SIAM J. Comput. 29(2), 671\u2013684 (1999). https:\/\/doi.org\/10.1137\/S0097539798344112","journal-title":"SIAM J. Comput."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00600-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00600-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00600-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T08:21:39Z","timestamp":1674807699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00600-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["600"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00600-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2022,7,18]]},"assertion":[{"value":"12 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}