{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:40:50Z","timestamp":1767991250179,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030126117","type":"print"},{"value":"9783030126124","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-12612-4_22","type":"book-chapter","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T11:25:44Z","timestamp":1549106744000},"page":"433-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations"],"prefix":"10.1007","author":[{"given":"Si","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisabeth","family":"Oswald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,3]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/11935308_38","volume-title":"Information and Communications Security","author":"S Nikova","year":"2006","unstructured":"Nikova, S., Rechberger, C., Rijmen, V.: Threshold implementations against side-channel attacks and glitches. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 529\u2013545. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935308_38"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s00145-010-9085-7","volume":"24","author":"S Nikova","year":"2011","unstructured":"Nikova, S., Rijmen, V., Schl\u00e4ffer, M.: Secure hardware implementation of nonlinear functions in the presence of glitches. J. Cryptol. 24(2), 292\u2013321 (2011)","journal-title":"J. Cryptol."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-33027-8_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"B Bilgin","year":"2012","unstructured":"Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., St\u00fctz, G.: Threshold implementations of all 3$$\\,\\times \\,$$3 and 4$$\\,\\times \\,$$4 S-boxes. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 76\u201391. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_5"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"De Meyer, L., Bilgin, B.: Classification of balanced quadratic functions. IACR Cryptology ePrint Archive, Report 2018\/113 (2018)","DOI":"10.46586\/tosc.v2019.i2.169-192"},{"issue":"1","key":"22_CR5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.46586\/tosc.v2017.i1.398-404","volume":"2017","author":"D Bozilov","year":"2017","unstructured":"Bozilov, D., Bilgin, B., Sahin, H.A.: A note on 5-bit quadratic permutations\u2019 classification. IACR Trans. Symmetric Cryptol. 2017(1), 398\u2013404 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-69453-5_5","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"T Beyne","year":"2017","unstructured":"Beyne, T., Bilgin, B.: Uniform first-order threshold implementations. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 79\u201398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_5"},{"issue":"3","key":"22_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.46586\/tches.v2018.i3.596-626","volume":"2018","author":"L De Meyer","year":"2018","unstructured":"De Meyer, L., Moradi, A., Wegener, F.: Spin me right round rotational symmetry for FPGA-specific AES. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3), 596\u2013626 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-66787-4_7","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"J Daemen","year":"2017","unstructured":"Daemen, J.: Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 137\u2013153. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_7"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s13389-017-0156-7","volume":"7","author":"E Boss","year":"2017","unstructured":"Boss, E., Grosso, V., G\u00fcneysu, T., Leander, G., Moradi, A., Schneider, T.: Strong 8-bit Sboxes with efficient masking in hardware extended version. J. Cryptogr. Eng. 7(2), 149\u2013165 (2017)","journal-title":"J. Cryptogr. Eng."},{"key":"22_CR10","unstructured":"Meyer, L.D., Varici, K.: More constructions for strong 8-bit S-boxes with efficient masking in hardware. In: Proceedings of the 38th Symposium on Information Theory in the Benelux, Delft, NE, p. 11. Werkgemeenschap voor Informatie- en Communicatietheorie (2017)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-89641-0_13","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"P Sasdrich","year":"2018","unstructured":"Sasdrich, P., Bock, R., Moradi, A.: Threshold implementation in software. In: Fan, J., Gierlichs, B. (eds.) COSADE 2018. LNCS, vol. 10815, pp. 227\u2013244. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89641-0_13"},{"issue":"3","key":"22_CR12","doi-asserted-by":"crossref","first-page":"627","DOI":"10.46586\/tches.v2018.i3.627-653","volume":"2018","author":"B Jungk","year":"2018","unstructured":"Jungk, B., Petri, R., Stottinger, M.: Efficient side-channel protections of ARX ciphers. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3), 627\u2013653 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-662-48324-4_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"J Balasch","year":"2015","unstructured":"Balasch, J., Gierlichs, B., Reparaz, O., Verbauwhede, I.: DPA, bitslicing and masking at 1 GHz. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 599\u2013619. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_30"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-55714-4_7","volume-title":"Lightweight Cryptography for Security and Privacy","author":"W de Groot","year":"2017","unstructured":"de Groot, W., Papagiannopoulos, K., de La Piedra, A., Schneider, E., Batina, L.: Bitsliced masking and ARM: friends or foes? In: Bogdanov, A. (ed.) LightSec 2016. LNCS, vol. 10098, pp. 91\u2013109. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55714-4_7"},{"key":"22_CR15","unstructured":"Daemen, J.: Cipher and hash function design, strategies based on linear and differential cryptanalysis. Ph.D. thesis, K. U. Leuven (1995). http:\/\/jda.noekeon.org\/"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-38348-9_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"G Bertoni","year":"2013","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 313\u2013314. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_19"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-40026-1_7","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"S Kutzner","year":"2013","unstructured":"Kutzner, S., Nguyen, P.H., Poschmann, A., Wang, H.: On 3-share threshold implementations for 4-bit S-boxes. In: Prouff, E. (ed.) COSADE 2013. LNCS, vol. 7864, pp. 99\u2013113. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40026-1_7"},{"key":"22_CR18","unstructured":"Gupta, N., Jati, A., Chattopadhyay, A., Sanadhya, S.K., Chang, D.: Threshold implementations of GIFT: a trade-off analysis. IACR Cryptology ePrint Archive, Report 2017\/1040 (2017)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48285-7_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"K Nyberg","year":"1994","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55\u201364. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_6"},{"issue":"1","key":"22_CR20","doi-asserted-by":"crossref","first-page":"398","DOI":"10.46586\/tosc.v2017.i1.398-404","volume":"2017","author":"D Bo\u017eilov","year":"2017","unstructured":"Bo\u017eilov, D., Bilgin, B., Sahin, H.: A note on 5-bit quadratic permutations\u2019 classification. IACR Trans. Symmetric Cryptol. 2017(1), 398\u2013404 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"22_CR21","unstructured":"Meyer, L.D., Bilgin, B.: Classification of balanced quadratic functions. Cryptology ePrint Archive, Report 2018\/113 (2018). https:\/\/eprint.iacr.org\/2018\/113"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov, A., et al.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12095-018-0311-8","volume":"11","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Picek, S., Leporati, A., Jakobovic, D.: Cellular automata based S-boxes. Cryptogr. Commun. 11, 41\u201362 (2018)","journal-title":"Cryptogr. Commun."},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-13858-4_19","volume-title":"Fast Software Encryption","author":"D Khovratovich","year":"2010","unstructured":"Khovratovich, D., Nikoli\u0107, I.: Rotational cryptanalysis of ARX. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 333\u2013346. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_19"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-73074-3_13","volume-title":"Arithmetic of Finite Fields","author":"G Leander","year":"2007","unstructured":"Leander, G., Poschmann, A.: On the classification of 4 bit S-boxes. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 159\u2013176. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73074-3_13"},{"key":"22_CR26","unstructured":"ARM: Arm and thumb-2 instruction set. http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.qrc0006e\/QRC0006_UAL16.pdf"},{"key":"22_CR27","unstructured":"ARM: Thumb 16-bit instruction set. http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.qrc0001m\/QRC0001_UAL.pdf"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-64647-3_1","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"T De Cnudde","year":"2017","unstructured":"De Cnudde, T., Bilgin, B., Gierlichs, B., Nikov, V., Nikova, S., Rijmen, V.: Does coupling affect the security of masked implementations? In: Guilley, S. (ed.) COSADE 2017. LNCS, vol. 10348, pp. 1\u201318. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64647-3_1"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-56620-7_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Goudarzi","year":"2017","unstructured":"Goudarzi, D., Rivain, M.: How fast can higher-order masking be in software? In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 567\u2013597. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_20"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-16763-3_5","volume-title":"Smart Card Research and Advanced Applications","author":"J Balasch","year":"2015","unstructured":"Balasch, J., Gierlichs, B., Grosso, V., Reparaz, O., Standaert, F.-X.: On the cost of lazy engineering for masked software implementations. In: Joye, M., Moradi, A. (eds.) CARDIS 2014. LNCS, vol. 8968, pp. 64\u201381. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16763-3_5"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-89641-0_14","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"F Wegener","year":"2018","unstructured":"Wegener, F., Moradi, A.: A first-order SCA resistant AES without fresh randomness. In: Fan, J., Gierlichs, B. (eds.) COSADE 2018. LNCS, vol. 10815, pp. 245\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89641-0_14"},{"issue":"7","key":"22_CR32","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1109\/TCAD.2015.2419623","volume":"34","author":"B Bilgin","year":"2015","unstructured":"Bilgin, B., Gierlichs, B., Nikova, S., Nikov, V., Rijmen, V.: Trade-offs for threshold implementations illustrated on AES. IEEE Trans. CAD Integr. Circuits Syst. 34(7), 1188\u20131200 (2015)","journal-title":"IEEE Trans. CAD Integr. Circuits Syst."},{"key":"22_CR33","unstructured":"Goodwill, G., Jun, B., Jaffe, J., Rohatgi, P.: A testing methodology for side channel resistance validation. Technical report, CRI (2011)"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-75208-2_7","volume-title":"Smart Card Research and Advanced Applications","author":"AA Ding","year":"2018","unstructured":"Ding, A.A., Zhang, L., Durvaux, F., Standaert, F.-X., Fei, Y.: Towards sound and optimal leakage detection procedure. In: Eisenbarth, T., Teglia, Y. (eds.) CARDIS 2017. LNCS, vol. 10728, pp. 105\u2013122. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75208-2_7"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12612-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:50:35Z","timestamp":1710334235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-12612-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030126117","9783030126124"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12612-4_22","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":"3 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"4 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.rsaconference.com\/events\/us19","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":"Shai Halevi's Web Submission","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"28","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":"37% - 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.4","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":"10","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)"}}]}}