{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T04:39:20Z","timestamp":1787027960432,"version":"build-2736575974"},"reference-count":113,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The Coefficients H technique (also called the H-technique), developed by Patarin circa 1991, is a tool used to obtain the upper bounds on distinguishing advantages. This tool is known to provide relatively simple and (in some cases) tight bound proofs in comparison to some other well-known tools, such as the game-playing technique and random systems methodology. In this systematization of knowledge (SoK) paper, we aim to provide a brief survey on the H-technique. The SoK is presented in four parts. First, we redevelop the necessary nomenclature and tools required to study the security of any symmetric-key design, especially in the H-technique setting. Second, we provide a full description of the H-technique and some related tools. Third, we present (simple) H-technique-based proofs for some popular symmetric-key designs, across different paradigms. Finally, we show that the H-technique can actually provide optimal bounds on distinguishing advantages.<\/jats:p>","DOI":"10.3390\/e24040462","type":"journal-article","created":{"date-parts":[[2022,3,27]],"date-time":"2022-03-27T21:27:51Z","timestamp":1648416471000},"page":"462","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5957-2837","authenticated-orcid":false,"given":"Ashwin","family":"Jha","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, 66123 Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata 700108, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"ref_1","unstructured":"Goldreich, O., Goldwasser, S., and Micali, S. (1984, January 24\u201326). How to Construct Random Functions (Extended Abstract). Proceedings of the 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, FL, USA."},{"key":"ref_2","unstructured":"Luby, M., and Rackoff, C. (1985, January 18\u201322). How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). Proceedings of the Advances in Cryptology\u2014CRYPTO \u201985, Santa Barbara, CA, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bellare, M., and Rogaway, P. (June, January 28). The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia.","DOI":"10.1007\/11761679_25"},{"key":"ref_4","first-page":"332","article-title":"Sequences of games: A tool for taming complexity in security proofs","volume":"2004","author":"Shoup","year":"2004","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic Encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). Theory and Applications of Trapdoor Functions (Extended Abstract). Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.45"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Shoup, V. (2000, January 14\u201318). Using Hash Functions as a Hedge against Chosen Ciphertext Attack. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_19"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s00145-002-0133-9","article-title":"OAEP Reconsidered","volume":"15","author":"Shoup","year":"2002","journal-title":"J. Cryptol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S0097539702403773","article-title":"Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack","volume":"33","author":"Cramer","year":"2003","journal-title":"SIAM J. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Shoup, V. (2003, January 17\u201321). Practical Verifiable Encryption and Decryption of Discrete Logarithms. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Abe, M., Gennaro, R., Kurosawa, K., and Shoup, V. (2005, January 22\u201326). Tag-KEM\/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark.","DOI":"10.1007\/11426639_8"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Landecker, W., Shrimpton, T., and Terashima, R.S. (2012, January 19\u201323). Tweakable Blockciphers with Beyond Birthday-Bound Security. Proceedings of the Advances in Cryptology\u2014CRYPTO 2012\u201432nd Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-32009-5_2"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1006\/jcss.1999.1694","article-title":"The Security of the Cipher Block Chaining Message Authentication Code","volume":"61","author":"Bellare","year":"2000","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Bellare, M., Pietrzak, K., and Rogaway, P. (2005). Improved Security Analyses for CBC MACs. Advances in Cryptology\u2014CRYPTO 2005, Springer.","DOI":"10.1007\/11535218_32"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00145-004-0016-3","article-title":"CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions","volume":"18","author":"Black","year":"2005","journal-title":"J. Cryptol."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yasuda, K. (2010, January 1\u20135). The Sum of CBC MACs Is a Secure PRF. Proceedings of the Topics in Cryptology\u2014CT-RSA 2010, The Cryptographers\u2019 Track at the RSA Conference 2010, San Francisco, CA, USA.","DOI":"10.1007\/978-3-642-11925-5_25"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yasuda, K. (2011, January 14\u201318). A New Variant of PMAC: Beyond the Birthday Bound. Proceedings of the Advances in Cryptology\u2014CRYPTO 2011\u201431st Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-22792-9_34"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Halevi, S., and Rogaway, P. (2003, January 17\u201321). A Tweakable Enciphering Mode. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-45146-4_28"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Halevi, S., and Rogaway, P. (2004, January 23\u201327). A Parallelizable Enciphering Mode. Proceedings of the Topics in Cryptology\u2014CT-RSA 2004, The Cryptographers\u2019 Track at the RSA Conference 2004, San Francisco, CA, USA.","DOI":"10.1007\/978-3-540-24660-2_23"},{"key":"ref_20","unstructured":"Halevi, S. (2007, January 19\u201323). Invertible Universal Hashing and the TET Encryption Mode. Proceedings of the Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1109\/TIT.2008.917623","article-title":"HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach","volume":"54","author":"Chakraborty","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, P., Feng, D., and Wu, W. (2005, January 15\u201317). HCTR: A Variable-Input-Length Enciphering Mode. Proceedings of the Information Security and Cryptology: First SKLOIS Conference, CISC 2005, Beijing, China.","DOI":"10.1007\/11599548_15"},{"key":"ref_23","unstructured":"Ristenpart, T., and Rogaway, P. (2007, January 26\u201328). How to Enrich the Message Space of a Cipher. Proceedings of the Fast Software Encryption, 14th International Workshop, FSE 2007, Luxembourg. Revised Selected Papers."},{"key":"ref_24","unstructured":"Sarkar, P. (2007, January 29\u201330). Improving Upon the TET Mode of Operation. Proceedings of the Information Security and Cryptology\u2014ICISC 2007, 10th International Conference, Seoul, Korea."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4749","DOI":"10.1109\/TIT.2009.2027487","article-title":"Efficient tweakable enciphering schemes from (block-wise) universal hash functions","volume":"55","author":"Sarkar","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1007\/s00145-011-9106-1","article-title":"On-line Ciphers and the Hash-CBC Constructions","volume":"25","author":"Bellare","year":"2012","journal-title":"J. Cryptol."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rogaway, P., and Zhang, H. (2011, January 14\u201318). Online Ciphers from Tweakable Blockciphers. Proceedings of the Topics in Cryptology\u2014CT-RSA 2011\u2014The Cryptographers\u2019 Track at the RSA Conference 2011, San Francisco, CA, USA.","DOI":"10.1007\/978-3-642-19074-2_16"},{"key":"ref_28","unstructured":"Forler, C., List, E., Lucks, S., and Wenzel, J. (2016, January 17\u201322). POEx: A Beyond-Birthday-Bound-Secure On-Line Cipher. Proceedings of the ArcticCrypt 2016, Svalbard, Norway. Available online: https:\/\/www.researchgate.net\/publication\/299565944_POEx_A_Beyond-Birthday-Bound-Secure_On-Line_Cipher."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s12095-017-0275-0","article-title":"On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers","volume":"10","author":"Jha","year":"2018","journal-title":"Cryptogr. Commun."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Rogaway, P., and Shrimpton, T. (June, January 28). A Provable-Security Treatment of the Key-Wrap Problem. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia.","DOI":"10.1007\/11761679_23"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Rogaway, P., Bellare, M., Black, J., and Krovetz, T. (2001, January 6\u20138). OCB: A block-cipher mode of operation for efficient authenticated encryption. Proceedings of the CCS 2001, Philadelphia, PA, USA.","DOI":"10.1145\/501983.502011"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Rogaway, P. (2004, January 5\u20139). Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea.","DOI":"10.1007\/978-3-540-30539-2_2"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Krovetz, T., and Rogaway, P. (2011, January 13\u201316). The Software Performance of Authenticated-Encryption Modes. Proceedings of the Fast Software Encryption\u201418th International Workshop (FSE 2011), Lyngby, Denmark. Revised Selected Papers.","DOI":"10.1007\/978-3-642-21702-9_18"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Bogdanov, A., Luykx, A., Mennink, B., Tischhauser, E., and Yasuda, K. (2013, January 1\u20135). Parallelizable and Authenticated Online Ciphers. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2013\u201419th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India. Part I.","DOI":"10.1007\/978-3-642-42033-7_22"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Abed, F., Fluhrer, S.R., Forler, C., List, E., Lucks, S., McGrew, D.A., and Wenzel, J. (2014, January 3\u20135). Pipelineable On-line Encryption. Proceedings of the Fast Software Encryption\u201421st International Workshop, FSE 2014, London, UK. Revised Selected Papers.","DOI":"10.1007\/978-3-662-46706-0_11"},{"key":"ref_36","unstructured":"Patarin, J. (2008, January 14\u201315). The \u201cCoefficients H\u201d Technique. Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, NB, Canada. Revised Selected Papers."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Patarin, J. (1990, January 5\u20139). Pseudorandom permutations based on the DES scheme. Proceedings of the EUROCODE \u201990, International Symposium on Coding Theory and Applications, Udine, Italy.","DOI":"10.1007\/3-540-54303-1_131"},{"key":"ref_38","unstructured":"Patarin, J. (1991). Etude des G\u00e9n\u00e9rateurs de Permutations Pseudo-Al\u00e9atoires Bas\u00e9s sur le Sch\u00e9ma du DES. [Ph.D. Thesis, Universit\u00e9 de Paris]."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Patarin, J. (1997, January 1\u20134). Improved Security Bounds for Pseudorandom Permutations. Proceedings of the 4th ACM Conference on Computer and Communications Security (CCS \u201997), Zurich, Switzerland.","DOI":"10.1145\/266420.266452"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Patarin, J. (1998, January 23\u201325). About Feistel Schemes with Six (or More) Rounds. Proceedings of the Fast Software Encryption, 5th International Workshop (FSE \u201998), Paris, France.","DOI":"10.1007\/3-540-69710-1_8"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Patarin, J. (2003, January 17\u201321). Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-45146-4_30"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","article-title":"Decorrelation: A Theory for Block Cipher Security","volume":"16","author":"Vaudenay","year":"2003","journal-title":"J. Cryptol."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s001459900051","article-title":"How to Stretch Random Functions: The Security of Protected Counter Sums","volume":"12","author":"Bernstein","year":"1999","journal-title":"J. Cryptol."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Nandi, M. (2006, January 11\u201313). A Simple and Unified Method of Proving Indistinguishability. Proceedings of the Progress in Cryptology\u2014INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India.","DOI":"10.1007\/11941378_23"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Chen, S., and Steinberger, J.P. (2014, January 11\u201315). Tight Security Bounds for Key-Alternating Ciphers. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark.","DOI":"10.1007\/978-3-642-55220-5_19"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Mouha, N., Mennink, B., Herrewege, A.V., Watanabe, D., Preneel, B., and Verbauwhede, I. (2014, January 14\u201315). Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers. Proceedings of the Selected Areas in Cryptography\u2014SAC 2014\u201421st International Conference, Montreal, QC, Canada. Revised Selected Papers.","DOI":"10.1007\/978-3-319-13051-4_19"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Mennink, B. (2015, January 8\u201311). Optimally Secure Tweakable Blockciphers. Proceedings of the Fast Software Encryption\u201422nd International Workshop (FSE 2015), Istanbul, Turkey. Revised Selected Papers.","DOI":"10.1007\/978-3-662-48116-5_21"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Patarin, J. (2004, January 15\u201319). Security of Random Feistel Schemes with 5 or More Rounds. Proceedings of the Advances in Cryptology\u2014CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-28628-8_7"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Nandi, M. (2010, January 12\u201315). The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants. Proceedings of the Progress in Cryptology\u2014INDOCRYPT 2010\u201411th International Conference on Cryptology in India, Hyderabad, India.","DOI":"10.1007\/978-3-642-17401-8_7"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Nandi, M. (2008, January 14\u201317). Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC. Proceedings of the Progress in Cryptology\u2014INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India.","DOI":"10.1007\/978-3-540-89754-5_27"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Lampe, R., Patarin, J., and Seurin, Y. (2012, January 2\u20136). An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2012, 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China.","DOI":"10.1007\/978-3-642-34961-4_18"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Chen, S., Lampe, R., Lee, J., Seurin, Y., and Steinberger, J.P. (2014, January 17\u201321). Minimizing the Two-Round Even-Mansour Cipher. Proceedings of the Advances in Cryptology\u2014CRYPTO 2014, 34th Annual Cryptology Conference, Santa Barbara, CA, USA. Part I.","DOI":"10.1007\/978-3-662-44371-2_3"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Cogliati, B., and Seurin, Y. (2015, January 26\u201330). On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria. Part I.","DOI":"10.1007\/978-3-662-46800-5_23"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Cogliati, B., Lampe, R., and Seurin, Y. (2015, January 16\u201320). Tweaking Even-Mansour Ciphers. Proceedings of the Advances in Cryptology\u2014CRYPTO 2015, 35th Annual Cryptology Conference, Santa Barbara, CA, USA. Part I.","DOI":"10.1007\/978-3-662-47989-6_9"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Cogliati, B., and Seurin, Y. (December, January 29). Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand. Part II.","DOI":"10.1007\/978-3-662-48800-3_6"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Bhaumik, R., and Nandi, M. (December, January 29). An Inverse-Free Single-Keyed Tweakable Enciphering Scheme. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand. Part II.","DOI":"10.1007\/978-3-662-48800-3_7"},{"key":"ref_57","first-page":"30","article-title":"OleF: An Inverse-Free Online Cipher. An Online SPRP with an Optimal Inverse-Free Construction","volume":"2016","author":"Bhaumik","year":"2016","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"253","DOI":"10.46586\/tosc.v2017.i3.253-270","article-title":"Efficient Length Doubling From Tweakable Block Ciphers","volume":"2017","author":"Chen","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Mennink, B. (2018, January 11\u201314). Towards Tight Security of Cascaded LRW2. Proceedings of the Theory of Cryptography\u201416th International Conference, TCC 2018, Panaji, India. Part II.","DOI":"10.1007\/978-3-030-03810-6_8"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1515\/jmc-2016-0030","article-title":"Revisiting Structure Graphs: Applications to CBC-MAC and EMAC","volume":"10","author":"Jha","year":"2016","journal-title":"J. Math. Cryptol."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Cogliati, B., and Seurin, Y. (2016, January 14\u201318). EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. Proceedings of the Advances in Cryptology\u2014CRYPTO 2016\u201436th Annual International Cryptology Conference, Santa Barbara, CA, USA. Part I.","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Mennink, B., and Neves, S. (2017, January 20\u201324). Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory. Proceedings of the Advances in Cryptology\u2014CRYPTO 2017\u201437th Annual International Cryptology Conference, Santa Barbara, CA, USA. Part III.","DOI":"10.1007\/978-3-319-63697-9_19"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"27","DOI":"10.46586\/tosc.v2017.i2.27-58","article-title":"New Constructions of MACs from (Tweakable) Block Ciphers","volume":"2017","author":"Cogliati","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"268","DOI":"10.46586\/tosc.v2017.i4.268-305","article-title":"Single Key Variant of PMAC_Plus","volume":"2017","author":"Datta","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"130","DOI":"10.46586\/tosc.v2017.i3.130-150","article-title":"Tight Security Analysis of EHtM MAC","volume":"2017","author":"Dutta","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"306","DOI":"10.46586\/tosc.v2017.i4.306-325","article-title":"ZMAC+\u2014An Efficient Variable-output-length Variant of ZMAC","volume":"2017","author":"List","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_67","first-page":"500","article-title":"Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC","volume":"2018","author":"Datta","year":"2018","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Datta, N., and Nandi, M. (2014, January 7\u20139). ELmE: A Misuse Resistant Parallel Authenticated Encryption. Proceedings of the Information Security and Privacy\u201419th Australasian Conference, ACISP 2014, Wollongong, Australia.","DOI":"10.1007\/978-3-319-08344-5_20"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Chakraborti, A., Iwata, T., Minematsu, K., and Nandi, M. (2017, January 25\u201328). Blockcipher-Based Authenticated Encryption: How Small Can We Go?. Proceedings of the Cryptographic Hardware and Embedded Systems\u2014CHES 2017\u201419th International Conference, Taipei, Taiwan.","DOI":"10.1007\/978-3-319-66787-4_14"},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Bhaumik, R., and Nandi, M. (2017, January 3\u20137). Improved Security for OCB3. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2017\u201423rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China. Part II.","DOI":"10.1007\/978-3-319-70697-9_22"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"218","DOI":"10.46586\/tches.v2018.i2.218-241","article-title":"Beetle Family of Lightweight and Secure Authenticated Encryption Ciphers","volume":"2018","author":"Chakraborti","year":"2018","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Bose, P., Hoang, V.T., and Tessaro, S. (May, January 29). Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2018\u201437th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel. Part I.","DOI":"10.1007\/978-3-319-78381-9_18"},{"key":"ref_73","unstructured":"Maurer, U.M. (May, January 28). Indistinguishability of Random Systems. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Maurer, U.M., and Pietrzak, K. (2003, January 4\u20138). The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland.","DOI":"10.1007\/3-540-39200-9_34"},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Maurer, U.M., and Pietrzak, K. (2004, January 19\u201321). Composition of Random Systems: When Two Weak Make One Strong. Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference (TCC 2004), Cambridge, MA, USA.","DOI":"10.1007\/978-3-540-24638-1_23"},{"key":"ref_76","unstructured":"Maurer, U.M., Pietrzak, K., and Renner, R. (2007, January 19\u201323). Indistinguishability Amplification. Proceedings of the Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA."},{"key":"ref_77","unstructured":"Minematsu, K., and Matsushima, T. (2007, January 26\u201328). New Bounds for PMAC, TMAC, and XCBC. Proceedings of the Fast Software Encryption (FSE 2007), Luxembourg."},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Minematsu, K. (2009, January 22\u201325). Beyond-Birthday-Bound Security Based on Tweakable Block Cipher. Proceedings of the Fast Software Encryption, 16th International Workshop (FSE 2009), Leuven, Belgium. Revised Selected Papers.","DOI":"10.1007\/978-3-642-03317-9_19"},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Minematsu, K., and Iwata, T. (2011, January 12\u201315). Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal. Proceedings of the Cryptography and Coding\u201413th IMA International Conference (IMACC 2011), Oxford, UK.","DOI":"10.1007\/978-3-642-25516-8_24"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10623-013-9882-8","article-title":"Building blockcipher from small-block tweakable blockcipher","volume":"74","author":"Minematsu","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_81","doi-asserted-by":"crossref","unstructured":"Minematsu, K., and Iwata, T. (2015, January 15\u201317). Tweak-Length Extension for Tweakable Blockciphers. Proceedings of the Cryptography and Coding\u201415th IMA International Conference (IMACC 2015), Oxford, UK.","DOI":"10.1007\/978-3-319-27239-9_5"},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Hoang, V.T., and Tessaro, S. (2016, January 14\u201318). Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security. Proceedings of the Advances in Cryptology\u2014CRYPTO 2016\u201436th Annual International Cryptology Conference, Santa Barbara, CA, USA. Part I.","DOI":"10.1007\/978-3-662-53018-4_1"},{"key":"ref_83","unstructured":"Hoang, V.T., and Tessaro, S. (May, January 30). The Multi-user Security of Double Encryption. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France. Part II."},{"key":"ref_84","first-page":"816","article-title":"Revisiting Key-alternating Feistel Ciphers for Shorter Keys and Multi-user Security","volume":"2018","author":"Guo","year":"2018","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_85","doi-asserted-by":"crossref","unstructured":"Mironov, I. (2002, January 18\u201322). (Not So) Random Shuffles of RC4. Proceedings of the Advances in Cryptology\u2014CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-45708-9_20"},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Morris, B., Rogaway, P., and Stegers, T. (2009, January 16\u201320). How to Encipher Messages on a Small Domain. Proceedings of the Advances in Cryptology\u2014CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-03356-8_17"},{"key":"ref_87","doi-asserted-by":"crossref","unstructured":"Hoang, V.T., and Rogaway, P. (2010, January 15\u201319). On Generalized Feistel Networks. Proceedings of the Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-14623-7_33"},{"key":"ref_88","doi-asserted-by":"crossref","unstructured":"Lampe, R., and Seurin, Y. (2013, January 11\u201313). Tweakable Blockciphers with Asymptotically Optimal Security. Proceedings of the Fast Software Encryption\u201420th International Workshop, FSE 2013, Singapore. Revised Selected Papers.","DOI":"10.1007\/978-3-662-43933-3_8"},{"key":"ref_89","doi-asserted-by":"crossref","unstructured":"Dai, W., Hoang, V.T., and Tessaro, S. (2017, January 20\u201324). Information-Theoretic Indistinguishability via the Chi-Squared Method. Proceedings of the Advances in Cryptology\u2014CRYPTO 2017\u201437th Annual International Cryptology Conference, Santa Barbara, CA, USA. Part III.","DOI":"10.1007\/978-3-319-63697-9_17"},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1007\/s12095-017-0276-z","article-title":"A note on the chi-square method: A tool for proving cryptographic security","volume":"10","author":"Bhattacharya","year":"2018","journal-title":"Cryptogr. Commun."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"314","DOI":"10.46586\/tosc.v2018.i1.314-335","article-title":"Revisiting Variable Output Length XOR Pseudorandom Function","volume":"2018","author":"Bhattacharya","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_92","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., and Nandi, M. (May, January 29). Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the \\chi ^2 Method. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2018\u201437th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel. Part I.","DOI":"10.1007\/978-3-319-78381-9_15"},{"key":"ref_93","first-page":"783","article-title":"Short Variable Length Domain Extenders with beyond Birthday Bound Security","volume":"2018","author":"Chen","year":"2018","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_94","first-page":"481","article-title":"Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance","volume":"2012","author":"Steinberger","year":"2012","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_95","doi-asserted-by":"crossref","unstructured":"Coron, J., Dodis, Y., Mandal, A., and Seurin, Y. (2010, January 9\u201311). A Domain Extender for the Ideal Cipher. Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference (TCC 2010), Zurich, Switzerland.","DOI":"10.1007\/978-3-642-11799-2_17"},{"key":"ref_96","doi-asserted-by":"crossref","unstructured":"Hall, C., Wagner, D.A., Kelsey, J., and Schneier, B. (1998, January 23\u201327). Building PRFs from PRPs. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201998, 18th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/BFb0055742"},{"key":"ref_97","first-page":"24","article-title":"A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion","volume":"1999","author":"Bellare","year":"1999","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_98","doi-asserted-by":"crossref","unstructured":"Lucks, S. (2000, January 14\u201318). The Sum of PRPs Is a Secure PRF. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_34"},{"key":"ref_99","first-page":"554","article-title":"How to Build Pseudorandom Functions From Public Random Permutations","volume":"2019","author":"Chen","year":"2019","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1111\/j.1751-5823.2002.tb00178.x","article-title":"On Choosing and Bounding Probability Metrics","volume":"70","author":"Gibbs","year":"2002","journal-title":"Int. Stat. Rev."},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., and Rackoff, C. (1985, January 6\u20138). The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, USA.","DOI":"10.1145\/22145.22178"},{"key":"ref_102","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., and Carter, L. (1979, January 29\u201331). New Classes and Applications of Hash Functions. Proceedings of the 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico.","DOI":"10.1109\/SFCS.1979.26"},{"key":"ref_103","doi-asserted-by":"crossref","unstructured":"Shoup, V. (2000, January 14\u201318). A Composition Theorem for Universal One-Way Hash Functions. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_32"},{"key":"ref_104","unstructured":"Berendschot, A., den Boer, B., Boly, J., Bosselaers, A., Brandt, J., Chaum, D., Damg\u00e5rd, I., Dichtl, M., Fumy, W., and van der Ham, M. (1995). Final Report of Race Integrity Primitives, Springer. Lecture Notes in Computer Science."},{"key":"ref_105","doi-asserted-by":"crossref","unstructured":"Luykx, A., Preneel, B., Tischhauser, E., and Yasuda, K. (2016, January 20\u201323). A MAC Mode for Lightweight Block Ciphers. Proceedings of the Fast Software Encryption\u2014FSE 2016, Bochum, Germany.","DOI":"10.1007\/978-3-662-52993-5_3"},{"key":"ref_106","doi-asserted-by":"crossref","unstructured":"Naor, M., and Reingold, O. (1997, January 4\u20136). On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, TX, USA.","DOI":"10.1145\/258533.258581"},{"key":"ref_107","doi-asserted-by":"crossref","unstructured":"Nachef, V., Patarin, J., and Volte, E. (2017). Feistel Ciphers\u2014Security Proofs and Cryptanalysis, Springer.","DOI":"10.1007\/978-3-319-49530-9"},{"key":"ref_108","unstructured":"Chakraborty, D., and Nandi, M. (2008, January 10\u201313). An Improved Security Bound for HCTR. Proceedings of the Fast Software Encryption\u2014FSE 2008, Lausanne, Switzerland. Revised Selected Papers."},{"key":"ref_109","doi-asserted-by":"crossref","unstructured":"Dworkin, M. (2001). Recommendation for Block Cipher Modes of Operation: Methods and Techniques, NIST, U.S. Department of Commerce. NIST Special Publication 800-38a.","DOI":"10.6028\/NIST.SP.800-38a"},{"key":"ref_110","first-page":"285","article-title":"A Generic Method to Extend Message Space of a Strong Pseudorandom Permutation","volume":"12","author":"Nandi","year":"2009","journal-title":"Comput. Sist."},{"key":"ref_111","unstructured":"Patarin, J. (2008, January 10\u201313). A Proof of Security in O(2n) for the Xor of Two Random Permutations. Proceedings of the Information Theoretic Security, Third International Conference (ICITS 2008), Calgary, AB, Canada."},{"key":"ref_112","first-page":"287","article-title":"Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography","volume":"2010","author":"Patarin","year":"2010","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_113","doi-asserted-by":"crossref","unstructured":"Cogliati, B., Patarin, J., and Seurin, Y. (2014, January 14\u201315). Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results. Proceedings of the Selected Areas in Cryptography\u2014SAC 2014\u201421st International Conference, Montreal, QC, Canada. Revised Selected Papers.","DOI":"10.1007\/978-3-319-13051-4_8"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/462\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:44:10Z","timestamp":1760136250000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,26]]},"references-count":113,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["e24040462"],"URL":"https:\/\/doi.org\/10.3390\/e24040462","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,26]]}}}