{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:28Z","timestamp":1740099088856,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319964171"},{"type":"electronic","value":"9783319964188"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96418-8_3","type":"book-chapter","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T06:57:13Z","timestamp":1531465033000},"page":"19-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Barthelemy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5467-7832","authenticated-orcid":false,"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7050-9975","authenticated-orcid":false,"given":"Gu\u00e9na\u00ebl","family":"Renault","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7861-158X","authenticated-orcid":false,"given":"Zoran","family":"\u0160uni\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,14]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-77535-5_5","volume-title":"Information Security Applications","author":"Y Zhou","year":"2007","unstructured":"Zhou, Y., Main, A., Gu, Y.X., Johnson, H.: Information hiding in software with mixed boolean-arithmetic transforms. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol. 4867, pp. 61\u201375. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77535-5_5"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Barthelemy, L., Eyrolles, N., Renault, G., Roblin, R.: Binary permutation polynomial inversion and application to obfuscation techniques. In: Proceedings of the 2nd International Workshop on Software Protection, Vienna, Austria. ACM, October 2016","DOI":"10.1145\/2995306.2995310"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cose.2017.07.006","volume":"70","author":"F Biondi","year":"2017","unstructured":"Biondi, F., Josse, S., Legay, A., Sirvent, T.: Effectiveness of synthesis in concolic deobfuscation. Comput. Secur. 70, 500\u2013515 (2017)","journal-title":"Comput. Secur."},{"issue":"3\u20134","key":"3_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01950276","volume":"44","author":"G Mullen","year":"1984","unstructured":"Mullen, G., Stevens, H.: Polynomial functions (mod $$m$$m). Acta Math. Hungar. 44(3\u20134), 237\u2013241 (1984)","journal-title":"Acta Math. Hungar."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/ffta.2000.0282","volume":"7","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L.: Permutation polynomials modulo $$2^w$$2w. Finite Fields Appl. 7(2), 287\u2013292 (2001)","journal-title":"Finite Fields Appl."},{"key":"3_CR6","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1960","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 4th edn. Clarendon Press, Oxford (1960)","edition":"4"},{"issue":"1\u20133","key":"3_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0024-3795(00)00124-5","volume":"315","author":"H Oru\u00e7","year":"2000","unstructured":"Oru\u00e7, H., Phillips, G.M.: Explicit factorization of the Vandermonde matrix. Linear Algebra Appl. 315(1\u20133), 113\u2013123 (2000)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"3_CR8","first-page":"59","volume":"18","author":"S Markovski","year":"2010","unstructured":"Markovski, S., \u0160uni\u0107, Z., Gligoroski, D.: Polynomial functions on the units of $$Z_{2^n}$$Z2n. Quasigr. Relat. Syst. 18(1), 59\u201382 (2010)","journal-title":"Quasigr. Relat. Syst."}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96418-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T15:35:20Z","timestamp":1571585720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96418-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319964171","9783319964188"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96418-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}