{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T15:57:56Z","timestamp":1772467076050,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030176525","type":"print"},{"value":"9783030176532","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-17653-2_10","type":"book-chapter","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:42:13Z","timestamp":1557808933000},"page":"285-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields"],"prefix":"10.1007","author":[{"given":"Lukas","family":"K\u00f6lsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,18]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-68351-3_15","volume-title":"New Stream Cipher Designs","author":"S Babbage","year":"2008","unstructured":"Babbage, S., Dodd, M.: The MICKEY stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 191\u2013209. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_15"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-662-53018-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., Kranz, T., Leander, G.: Lightweight multiplication in $$GF(2^n)$$ with applications to MDS matrices. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 625\u2013653. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_23"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11545262_32","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"D Canright","year":"2005","unstructured":"Canright, D.: A very compact S-box for AES. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 441\u2013455. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11545262_32"},{"key":"10_CR4","unstructured":"Daemen, J., Rijmen, V.: Correlation analysis in $${GF}(2^n)$$. In: Junod, P., Canteaut, A. (eds.) Advanced Linear Cryptanalysis of Block and Stream Ciphers. Cryptology and Information Security, pp. 115\u2013131. IOS Press (2011)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-68351-3_18","volume-title":"New Stream Cipher Designs","author":"C De Canni\u00e8re","year":"2008","unstructured":"De Canni\u00e8re, C., Preneel, B.: Trivium. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 244\u2013266. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_18"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.13154\/tosc.v2018.i2.48-78","volume":"2018","author":"S Duval","year":"2018","unstructured":"Duval, S., Leurent, G.: MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2018(2), 48\u201378 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i2.48-78","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-13152-7","volume-title":"The Classical Groups and K-Theory","author":"A Hahn","year":"1989","unstructured":"Hahn, A., O\u2019Meara, T.: The Classical Groups and K-Theory. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/978-3-662-13152-7"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1504\/IJWMC.2007.013798","volume":"2","author":"M Hell","year":"2007","unstructured":"Hell, M., Johansson, T., Meier, W.: Grain; a stream cipher for constrained environments. Int. J. Wire. Mob. Comput. 2(1), 86\u201393 (2007). https:\/\/doi.org\/10.1504\/IJWMC.2007.013798","journal-title":"Int. J. Wire. Mob. Comput."},{"key":"10_CR9","volume-title":"Linear Algebra","author":"K Hoffman","year":"1961","unstructured":"Hoffman, K., Kunze, R.: Linear Algebra. Prentice-Hall, Englewood Cliffs (1961)"},{"issue":"4","key":"10_CR10","doi-asserted-by":"crossref","first-page":"130","DOI":"10.46586\/tosc.v2017.i4.130-168","volume":"2017","author":"J Jean","year":"2017","unstructured":"Jean, J., Peyrin, T., Sim, S.M., Tourteaux, J.: Optimizing implementations of lightweight building blocks. IACR Trans. Symmetric Cryptol. 2017(4), 130\u2013168 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9947-1949-0031470-3","volume":"66","author":"I Kaplansky","year":"1949","unstructured":"Kaplansky, I.: Elementary divisors and modules. Trans. Amer. Math. Soc. 66, 464\u2013491 (1949). https:\/\/doi.org\/10.1090\/S0002-9947-1949-0031470-3","journal-title":"Trans. Amer. Math. Soc."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-44709-3_24","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"K Khoo","year":"2014","unstructured":"Khoo, K., Peyrin, T., Poschmann, A.Y., Yap, H.: FOAM: searching for hardware-optimal SPN structures and components with a fair comparison. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 433\u2013450. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.13154\/tosc.v2017.i4.188-211","volume":"2017","author":"T Kranz","year":"2017","unstructured":"Kranz, T., Leander, G., Stoffelen, K., Wiemer, F.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symmetric Cryptol. 2017(4), 188\u2013211 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i4.188-211. https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/813","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-38424-3_8","volume-title":"Advances in Cryptology-CRYPT0 1990","author":"BA LaMacchia","year":"1991","unstructured":"LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109\u2013133. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_8"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-52993-5_7","volume-title":"Fast Software Encryption","author":"Y Li","year":"2016","unstructured":"Li, Y., Wang, M.: On the construction of lightweight circulant involutory MDS matrices. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 121\u2013139. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_7"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-52993-5_6","volume-title":"Fast Software Encryption","author":"M Liu","year":"2016","unstructured":"Liu, M., Sim, S.M.: Lightweight MDS generalized circulant matrices. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 101\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_6"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-28496-0_7","volume-title":"Selected Areas in Cryptography","author":"M-JO Saarinen","year":"2012","unstructured":"Saarinen, M.-J.O.: Cryptographic analysis of all 4 $$\\times $$ 4-bit S-boxes. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 118\u2013133. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_7"},{"key":"10_CR18","unstructured":"Sajadieh, M., Mousavi, M.: Construction of lightweight MDS matrices from generalized feistel structures. IACR Cryptology ePrint Archive 2018, 1072 (2018)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-31517-1_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S., Sim, S.M.: A deeper understanding of the XOR count distribution in the context of lightweight cryptography. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 167\u2013182. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31517-1_9"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-48116-5_23","volume-title":"Fast Software Encryption","author":"SM Sim","year":"2015","unstructured":"Sim, S.M., Khoo, K., Oggier, F., Peyrin, T.: Lightweight MDS involution matrices. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 471\u2013493. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_23"},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.2140\/pjm.1962.12.1099","volume":"12","author":"RG Swan","year":"1962","unstructured":"Swan, R.G.: Factorization of polynomials over finite fields. Pacific J. Math. 12(3), 1099\u20131106 (1962)","journal-title":"Pacific J. Math."},{"key":"10_CR22","unstructured":"Zhao, R., Wu, B., Zhang, R., Zhang, Q.: Designing optimal implementations of linear layers (full version). Cryptology ePrint Archive, Report 2016\/1118 (2016)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17653-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:49:27Z","timestamp":1709833767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17653-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030176525","9783030176532"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17653-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"327","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}