{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:47:32Z","timestamp":1742996852301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925178"},{"type":"electronic","value":"9783030925185"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92518-5_2","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T07:03:27Z","timestamp":1638947007000},"page":"26-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["tHyENA: Making HyENA Even Smaller"],"prefix":"10.1007","author":[{"given":"Avik","family":"Chakraborti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nilanjan","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuauhtemoc","family":"Mancillas-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-66787-4_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"S Banik","year":"2017","unstructured":"Banik, S., Pandey, S.K., Peyrin, T., Sasaki, Yu., Sim, S.M., Todo, Y.: GIFT: a small present. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 321\u2013345. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_16"},{"key":"2_CR2","first-page":"440","volume":"2019","author":"A Chakraborti","year":"2019","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mancillas-L\u00f3pez, C., Nandi, M., Sasaki, Yu.: Elastic-tweak: a framework for short tweak tweakable block cipher. IACR Cryptol. ePrint Arch. 2019, 440 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"2_CR3","first-page":"81","volume":"2019","author":"A Chakraborti","year":"2019","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mancillas-L\u00f3pez, C., Nandi, M., Sasaki, Yu.: INT-RUP secure lightweight parallel AE modes. IACR Trans. Symmetric Cryptol. 2019(4), 81\u2013118 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"S1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.46586\/tosc.v2020.iS1.350-389","volume":"2020","author":"A Chakraborti","year":"2020","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mancillas-L\u00f3pez, C., Nandi, M., Sasaki, Yu.: ESTATE: a lightweight and low energy authenticated encryption mode. IACR Trans. Symmetric Cryptol. 2020(S1), 350\u2013389 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"S1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.46586\/tosc.v2020.iS1.417-445","volume":"2020","author":"A Chakraborti","year":"2020","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mitragotri, S., Nandi, M.: From combined to hybrid: making feedback-based AE even smaller. IACR Trans. Symmetric Cryptol. 2020(S1), 417\u2013445 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/jmc-2017-0011","volume":"12","author":"A Chakraborti","year":"2018","unstructured":"Chakraborti, A., Datta, N., Nandi, M.: On the optimality of non-linear computations for symmetric key primitives. J. Math. Cryptol. 12(4), 241\u2013259 (2018)","journal-title":"J. Math. Cryptol."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-66787-4_14","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"A Chakraborti","year":"2017","unstructured":"Chakraborti, A., Iwata, T., Minematsu, K., Nandi, M.: Blockcipher-based authenticated encryption: how small can we go? In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 277\u2013298. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_14"},{"key":"2_CR8","first-page":"649","volume":"2017","author":"A Chakraborti","year":"2017","unstructured":"Chakraborti, A., Iwata, T., Minematsu, K., Nandi, M.: Blockcipher-based authenticated encryption: how small can we go? IACR Cryptol. ePrint Arch. 2017, 649 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00145-019-09325-z","volume":"33","author":"A Chakraborti","year":"2020","unstructured":"Chakraborti, A., Iwata, T., Minematsu, K., Nandi, M.: Blockcipher-based authenticated encryption: how small can we go? J. Cryptol. 33(3), 703\u2013741 (2020)","journal-title":"J. Cryptol."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 327\u2013350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_19"},{"key":"2_CR11","unstructured":"CAESAR Committee: CAESAR: Competition for Authenticated Encryption: Security, Applicability, and Robustness. http:\/\/competitions.cr.yp.to\/caesar.html\/"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Eskandari, Z., Kidmose, A.B., K\u00f6lbl, S., Tiessen, T.: Finding integral distinguishers with ease. In: Cid, C., Jacobson, M.J., Jr. (eds.) Selected Areas in Cryptography - SAC 2018, Revised Selected Papers. LNCS, vol. 11349, pp. 115\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_6","DOI":"10.1007\/978-3-030-10970-7_6"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-34047-5_12","volume-title":"Fast Software Encryption","author":"E Fleischmann","year":"2012","unstructured":"Fleischmann, E., Forler, C., Lucks, S.: McOE: a family of almost foolproof on-line authenticated encryption schemes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 196\u2013215. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_12"},{"key":"2_CR14","unstructured":"Iwata, T., Minematsu, K., Guo, J., Morioka, S., Kobayashi, E.: CLOC and SILC. Submission to CAESAR (2016). https:\/\/competitions.cr.yp.to\/round3\/clocsilcv3.pdf"},{"key":"2_CR15","unstructured":"Kumar, S., Haj-Yihia, J., Khairallah, M., Chattopadhyay, A.: A comprehensive performance analysis of hardware implementations of CAESAR candidates. IACR Cryptology ePrint Archive 2017:1261 (2017)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-030-21548-4_30","volume-title":"Information Security and Privacy","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Sasaki, Yu.: Related-key boomerang attacks on GIFT with automated trail search including BCT effect. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 555\u2013572. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_30"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-319-63697-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 556\u2013583. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_19"},{"key":"2_CR18","unstructured":"Montes, M., Penazzi, D.: AES-CPFB v1. Submission to CAESAR (2015). https:\/\/competitions.cr.yp.to\/round1\/aescpfbv1.pdf"},{"key":"2_CR19","unstructured":"NIST: Lightweight cryptography. https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography"},{"key":"2_CR20","unstructured":"National Centre of Excellence. Light-weight Cipher Design Challenge. https:\/\/www.dsci.in\/ncoe-light-weight-cipher-design-challenge-2020\/"},{"key":"2_CR21","unstructured":"Patarin, J.: Etude de G\u00e9\u0144erateurs de Permutations Bas\u00e9s sur les Sch\u00e9mas du DES. Ph.D thesis. Inria, Domaine de Voluceau, France (1991)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Patarin, J.: The \u201cCoefficients H\u201d technique. In: SAC 2008, pp. 328\u2013345 (2008)","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"P Rogaway","year":"2006","unstructured":"Rogaway, P., Shrimpton, T.: A provable-security treatment of the key-wrap problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 373\u2013390. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_23"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-97916-8_15","volume-title":"Advances in Information and Computer Security","author":"Yu Sasaki","year":"2018","unstructured":"Sasaki, Yu.: Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT. In: Inomata, A., Yasuda, K. (eds.) IWSEC 2018. LNCS, vol. 11049, pp. 227\u2013243. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97916-8_15"},{"key":"2_CR25","unstructured":"Zhang, L., Wu, W., Sui, H., Wang, P.: iFeed[AES] v1. Submission to CAESAR (2014). https:\/\/competitions.cr.yp.to\/round1\/ifeedaesv1.pdf"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-030-12612-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"B Zhu","year":"2019","unstructured":"Zhu, B., Dong, X., Yu, H.: MILP-based differential attack on round-reduced GIFT. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 372\u2013390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_19"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92518-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:35:31Z","timestamp":1710268531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92518-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925178","9783030925185"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92518-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2021.lnmiit.ac.in\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"27","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":"42% - 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.2","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":"4","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)"}}]}}