Brand New Categories of Cryptographic Hash Functions: A Survey

Sefid-Dashti, B.; Salimi Sartakhti, J.; Daghigh, H.

doi:10.22061/jecei.2023.9271.598

Document Type : Original Research Paper

Authors

¹ Department of Computer Engineering, University of Kashan, Kashan, Iran.

² Faculty of Mathematical Science, University of Kashan, Kashan, Iran.

https://doi.org/10.22061/jecei.2023.9271.598

Abstract

Background and Objectives: Cryptographic hash functions are the linchpins of mobile services, blockchains, and many other technologies. Designing cryptographic hash functions has been approached by research communities from the physics, mathematics, computer science, and electrical engineering fields. The emergence of new hash functions, new hash constructions, and new requirements for application-specific hash functions, such as the ones of mobile services, have encouraged us to make a comparison of different hash functions and propose a new classification.
Methods: Over 100 papers were surveyed and reviewed in detail. The research conducted in this paper has included four sections; article selection, detailed review of selected articles, data collection, and evaluation of results. Data were collected as new hash function properties, new hash function constructions, new hash function categories, and existing hash function attacks which are used to evaluate the results.
Results: This paper surveys seven categories of hash functions including block cipher-based functions, algebraic-based functions, custom-designed functions, Memory-hard Functions (MHFs), Physical Unclonable Functions (PUFs), quantum hash functions and optical hash functions. To the best of our knowledge, the last four mentioned categories have not been sufficiently addressed in most existing surveys. Furthermore, this paper overviews hash-related adversaries and six hash construction variants. In addition, we employed the mentioned adversaries as evaluation criteria to illustrate how different categories of hash functions withstand the mentioned adversaries. Finally, the surveyed hash function categories were evaluated against mobile service requirements.
Conclusion: In addition to new classification, our findings suggest using PUFs with polynomial-time error correction or possibly bitwise equivalents of algebraic structures that belongs to post-quantum cryptography as candidates to assist mobile service interaction requirements.

Keywords

20.1001.1.23223952.2023.11.2.9.1

Main Subjects

Cryptography

Open Access

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit: http://creativecommons.org/licenses/by/4.0/

Publisher’s Note

JECEI Publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Publisher

Shahid Rajaee Teacher Training University

References

[1] J. Hoffstein, J. Pipher, J. H. Silverman, An introduction to mathematical cryptography. New York: Springer, 2008.

[2] H. C. A. van Tilborg, S. Jajodia, Eds., Encyclopedia of cryptography and security. Springer Science+Business Media, 2011.

[3] J. Keller and S. Wendzel, “Reversible and plausibly deniable covert channels in one-time passwords based on hash chains,” Appl. Sci., 11(2): 731, 2021.

[4] W. Stallings, Cryptography and network security: principles and practice, sixth ed. Pearson Education, 2014.

[5] C. Wang, S. J. Li, D. Wang, Q. H. Wang, “P-28: A method of holographic encryption based on hash function,” Dig. Tech. Pap., 47(1): 1228–1230, 2016.

[6] L. C. Washington, Elliptic curves: number theory and cryptography, second ed. Boca Raton, Fl: Chapman & Hall/Crc, 2008.

[7] R. C. Merkle, “A certified digital signature,” in Proc. Conf. on the Theory and Application of Cryptology: 218-238, 1989.

[8] J. Rosenberg, D. L. Remy, Securing web services with WS-security: demystifying WS-security, WS-policy, SAML, XML signature, and XML encryption. Indianapolis, Ind.: Sams, 2004.

[9] A. Nadalin, C. Kaler, R. Monzillo, P. Hallam-Baker, Eds., Web services security: SOAP message security 1.1. OASIS, 2006. Last accessed: Jan. 7, 2023.

[10] L. Demir, A. Kumar, M. Cunche, C. Lauradoux, “The pitfalls of hashing for privacy,” IEEE Commun. Surv. Tutor., 20(1): 551-565, 2018.

[11] M. Wang, M. Duan, J. Zhu, “Research on the security criteria of hash functions in the blockchain,” in Proc. the 2nd ACM Workshop on Blockchains, Cryptocurrencies, and Contracts: 47-55, 2018.

[12] S. Abed, R. Jaffal, B. J. Mohd, M. Al-Shayeji, “An analysis and evaluation of lightweight hash functions for blockchain-based IoT devices,” Cluster Comput., 24(4): 3065-3084, 2021.

[13] A. Kuznetsov, I. Oleshko, V. Tymchenko, K. Lisitsky, M. Rodinko, A. Kolhatin, “Performance analysis of cryptographic hash functions suitable for use in blockchain,” Int. j. comput. netw. inf. secur., 13(2): 1-15, 2021.

[14] A. M. Antonopoulos, Mastering bitcoin: Programming the open blockchain, 2nd ed. O’Reilly Media, 2017.

[15] J. Garay, A. Kiayias, N. Leonardos, “The bitcoin backbone protocol: Analysis and applications,” in Proc. Annu. Int. Conf. on the Theory and Applications of Cryptographic Techniques: 281-310, 2015.

[16] G. Wu, J. Han, Y. Guo, L. Liu, G. Ding, Q. Ni, L. Shao, “Unsupervised deep video hashing via balanced code for large-scale video retrieval,” IEEE Trans. Image Process., 28(4): 1993-2007, 2019.

[17] M. S. Jan, M. Afzal, “Hash chain based strong password authentication scheme,” in Proc. 13th Int. Bhurban Conf. on Applied Sciences and Technology (IBCAST): 355-360, 2016.

[18] A. A. Alkandari, I. F. Al-Shaikhli, M. A. Alahmad, “Cryptographic hash function: A high level view,” in Proc. 2013 Int. Conf. on Informatics and Creative Multimedia: 128-134, 2013.

[19] B. Preneel, “The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition,” in Proc. Cryptographers’ track at the RSA Conf.: 1-14, 2010.

[20] G. Bertoni, J. Daemen, M. Peeters, G. Van Assche, “Keccak,” in Proc. 32nd Annu. Int. Conf. on the Theory and Applications of Cryptographic Techniques: 313-314, 2013.

[21] W. Stallings, “Inside SHA-3,” IEEE Potentials, 32(6): 26-31, 2013.

[22] A. Biryukov, D. Dinu, D. Khovratovich, “Argon2: new generation of memory-hard functions for password hashing and other applications,” in Proc. 2016 IEEE European Symposium on Security and Privacy (EuroS&P), Saarbruecken, Germany: 292-302, 2016.

[23] S. Shen, X. Lee, R. Tse, W. Wong, Y. Yang, “The SM3 cryptographic hash function,” draft-sca-cfrg-sm3-02, 2018.

[24] V. Dolmatov, A. Degtyarev, “GOST R 34.11-2012: hash function,” RFC 6986, 2013.

[25] R. Oliynykov, I. Gorbenko, O. Kazymyrov, V. Ruzhentsev, O. Kuznetsov, Y. Gorbenko, A. Boiko, O. Dyrda, V. Dolgov, A. Pushkaryov, “A new standard of Ukraine: The Kupyna hash function,” Cryptology ePrint Archive, DSTU 7564: 2014, 2015.

[26] S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk, “Cryptographic hash functions: A survey,” Department of Computer Science, University of Wollongong, Technical Report 95-09, Jul. 1995.

[27] J. Delvaux, R. Peeters, D. Gu, I. Verbauwhede, “A survey on lightweight entity authentication with strong PUFs,” ACM Comput. Surv., 48(2): 1-42, 2015.

[28] I. Mironov, “Hash functions: Theory, attacks, and applications,” Microsoft Research, Silicon Valley Campus, 1-22, Nov. 2005.

[29] R. Purohit, U. Mishra, A. Bansal, "A survey on recent cryptographic hash function designs," Int. J. Emerging Trends & Technology in Computer Science (IJETTCS), 2(1): 2278-6856, 2013.

[30] A. Narayanan, J. Bonneau, E. W. Felten, A. Miller, S. Goldfeder, Bitcoin and cryptocurrency technologies: A comprehensive introduction. Princeton, NJ: Princeton University Press, 2016.

[31] M. Rjaško, “On chosen target forced prefix preimage resistance,” Tatra Mt. Math. Publ., 47(1): 115-135, 2010.

[32] B. Mennink, “Increasing the flexibility of the herding attack,” Inf. Process. Lett., 112(3): 98-105, 2012.

[33] E. Andreeva, B. Mennink, “Provable chosen-target-forced-midfix preimage resistance,” in Int. Workshop on Selected Areas in Cryptography: 37-54, 2011.

[34] A. R. Zamanov, V. A. Erokhin, P. S. Fedotov, “ASIC-resistant hash functions,” in Proc. 2018 IEEE Conf. of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus): 394-396, 2018.

[35] H. Chen, Y. Wo, G. Han, “Multi-granularity geometrically robust video hashing for tampering detection,” Multimed. Tools Appl., 77(5): 5303-5321, 2017.

[36] R. L. Rivest, B. Agre, D. V. Bailey, C. Crutchfield, Y. Dodis, K. E. Fleming, A. Khan, J. Krishnamurthy, Y. Lin, L. Reyzin, E. Shen, J. Sukha, D. Sutherland, E. Tromer, Y. L. Yin, “The MD6 hash function–a proposal to NIST for SHA-3,” Submission to NIST, 2(3), 2008.

[37] R. Reischuk, M. Hinkelmann, “One-way functions - mind the trap - escape only for the initiated,” in Proc. Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 131-139, 2011.

[38] O. Goldreich, S. Goldwasser, S. Halevi, “Collision-free hashing from lattice problems,” in Proc. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Berlin, Heidelberg: Springer Berlin Heidelberg, 30-39, 2011.

[39] W. Hu, N. Xie, L. Li, X. Zeng, S. Maybank, “A survey on visual content-based video indexing and retrieval,” IEEE Trans. Syst. Man Cybern. C Appl. Rev., 41(6): 797-819, 2011.

[40] A. Appleby, Murmurhash 3.0, 2016. Last accessed: Aug. 25, 2022.

[41] C. Estébanez, Y. Saez, G. Recio, P. Isasi, “Performance of the most common non-cryptographic hash functions,” Softw. Pract. Exp., 44(6): 681-698, 2014.

[42] S. Chen and C. Jin, “A second preimage attack on zipper hash,” Secur. Commun. Netw.,. 8(16): 2860–2866, 2015.

[43] M. Liskov, “Constructing an ideal hash function from weak ideal compression functions,” in Proc. 13th Int. Workshop on Selected Areas in Cryptography: 358-375, 2006.

[44] B. Denton, R. Adhami, “Modern hash function construction,” in Proc. the Int. Conf. on Security and Management (SAM): 479-483, 2011.

[45] Z. Bao, I. Dinur, J. Guo, G. Leurent, L. Wang, “Generic attacks on hash combiners,” J. Cryptology, 33(3): 742-823, 2019.

[46] M. Fischlin, A. Lehmann, D. Wagner, “Hash function combiners in TLS and SSL,” in Proc. Cryptographers’ Track at the RSA Conf.: 268–283, 2010.

[47] D. X. Charles, K. E. Lauter, E. Z. Goren, “Cryptographic hash functions from expander graphs,” J. Cryptology, 22(1): 93-113, 2009.

[48] C. Petit, J. J. Quisquater, “Cryptographic hash functions and expander graphs: The end of the story?,” in Proc. The New Codebreakers, Berlin, Heidelberg: Springer Berlin Heidelberg: 304–311, 2016.

[49] B. A. Forouzan, Cryptography & network security. Maidenhead, England: McGraw Hill Higher Education, 2007.

[50] R. C. Merkle, “One way hash functions and DES,” in Proc. Conf. on the Theory and Application of Cryptology: 428-446, 1989.

[51] I. B. Damgård, “A design principle for hash functions,” in Conf. on the Theory and Application of Cryptology: 416-427, 1989.

[52] E. Andreeva, G. Neven, B. Preneel, T. Shrimpton, “Seven-property-preserving iterated hashing: ROX,” in Proc. 13th Int. Conf. on the Theory and Application of Cryptology and Information Security: 130-146, 2007.

[53] V. Shoup, “A composition theorem for universal one-way hash functions,” in Int. Conf. on the Theory and Applications of Cryptographic Techniques: 445-452, 2000.

[54] I. Mironov, “Hash functions: From merkle-damgård to shoup,” in Proc. Int. Conf. on the Theory and Applications of Cryptographic Techniques: 166-181, 2001.

[55] E. Andreeva, C. Bouillaguet, O. Dunkelman, J. Kelsey, “Herding, second preimage and trojan message attacks beyond Merkle-Damgård,” in Proc. 16th Int. Workshop on Selected Areas in Cryptography: 393-414, 2009.

[56] J. Katz, Y. Lindell, Introduction to modern cryptography, 2nd ed. Philadelphia, PA: Chapman & Hall/CRC, 2014.

[57] K. Malvoni, J. Knezovic, “Are your passwords safe: Energy-Efficient Bcrypt Cracking with Low-Cost Parallel Hardware,” in Proc. 8th USENIX Workshop on Offensive Technologies (WOOT 14): 1-7, 2014.

[58] H. J. Mun, S. Hong, J. Shin, “A novel secure and efficient hash function with extra padding against rainbow table attacks,” Cluster Computing, 21(1): 1161-1173, 2017.

[59] E. Conrad, S. Misenar, J. Feldman, Cissp Study Guide, 2nd ed. Waltham, MA, USA: Syngress Publishing, 2012.

[60] J. Guo, S. Ling, C. Rechberger, H. Wang, “Advanced meet-in-the-middle preimage attacks: First results on full Tiger, and improved results on MD4 and SHA-2,” in 16th Int. Conf. on the Theory and Application of Cryptology and Information Security: 56-75, 2010.

[61] K. Aoki, Y. Sasaki, “Preimage attacks on one-block MD4, 63-step MD5 and more,” in Proc. 15th Annu. Int. workshop on selected areas in cryptography: 103-119, 2008.

[62] S. Knellwolf, D. Khovratovich, “New preimage attacks against reduced SHA-1,” in Proc. 32nd Annu. Cryptology Conf.: 367-383, 2012.

[63] K. Aoki, Y. Sasaki, “Meet-in-the-middle preimage attacks against reduced SHA-0 and SHA-1,” in Proc. 29th Annu. Int. Cryptology Conf.: 70-89, 2009.

[64] K. Aoki, J. Guo, K. Matusiewicz, Y. Sasaki, L. Wang, “Preimages for step-reduced SHA-2,” in Proc. 15th Int. Conf. on the Theory and Application of Cryptology and Information Security: 578-597, 2009.

[65] J. Kelsey, T. Kohno, “Herding hash functions and the Nostradamus attack,” in Proc. Annu. Int. Conf. on the Theory and Applications of Cryptographic Techniques: 183-200, 2006.

[66] M. Stamp, R. M. Low, Applied cryptanalysis: breaking ciphers in the real world. Hoboken, N.J.: Wiley-Interscience, 2007.

[67] W. Stallings, Network security essentials: Applications and standards, 4th ed. Prentice Hall, 2010.

[68] G. V. Bard, Algebraic Cryptanalysis. Springer, 2009.

[69] D. Jovanović, P. Janičić, “Logical analysis of hash functions,” in 5th Int. Workshop on Frontiers of Combining Systems: 200-215, 2005.

[70] F. Massacci, L. Marraro, “Logical cryptanalysis as a SAT problem,” J. Automated Reasoning, 24(1): 165-203, 2000.

[71] F. Legendre, G. Dequen, M. Krajecki, “Encoding hash functions as a sat problem,” in Proc. 2012 IEEE 24th Int. Conf. on Tools with Artificial Intelligence, 1: 916-921, 2012.

[72] D. De, A. Kumarasubramanian, R. Venkatesan, “Inversion attacks on secure hash functions using SAT solvers,” in 10th Int. Conf. on Theory and Applications of Satisfiability Testing: 377-382, 2007.

[73] P. Morawiecki, M. Srebrny, “A SAT-based preimage analysis of reduced Keccak hash functions,” Inf. Process. Lett., 113(10-11): 392-397, 2013.

[74] E. Homsirikamol, P. Morawiecki, M. Rogawski, M. Srebrny, “Security margin evaluation of SHA-3 contest finalists through SAT-based attacks,” in Proc. 11th IFIP Int. Conf. on Computer Information Systems and Industrial Management: 56-67, 2012.

[75] X. Wang, H. Yu, “How to break MD5 and other hash functions,” in Proc. 24th Annu. Int. Conf. on the Theory and Applications of Cryptographic Techniques: 19-35, 2005.

[76] X. Wang, Y. L. Yin, H. Yu, “Finding collisions in the full SHA-1,” in Proc. 25th Annu. Int. Cryptology Conf.: 17-36, 2005.

[77] W. Vinci, T. Albash, A. Mishra, P. A. Warburton, D. A. Lidar, “Distinguishing classical and quantum models for the d-wave device,” Cornell University Library, 2014.

[78] E. Knill, “Quantum computing,” Nature, 463(7280): 441-443, 2010.

[79] “D-Wave announces first order for 2000Q quantum computer,” ID Quantique, 24-Feb-2017. Last accessed: Jan. 10, 2023. Available at: D-Wave Announces D-Wave 2000Q Quantum Computer and First System Order — D-Wave Government (dwavefederal.com).

[80]“With new Microsoft breakthroughs, general purpose quantum computing moves closer to reality,” Stories, Sep. 25, 2017. Last accessed: Jan. 10, 2023.

[81] “Quantum simulator,” Google Quantum AI. Last accessed: Jan. 10, 2023.

[82] “qiskit.org,” Qiskit.org. Last accessed: Jan. 10, 2023.

[83] “D-wave ocean software documentation — ocean documentation 5.3.0 documentation,” Dwavesys.com. Last accessed: Jan. 10, 2023.

[84] A. J. Abhari et al., “Scaffold: Quantum programming language,” Princeton univ NJ dept of computer science, Rep. TR-934-12, 2012. Last accessed: Jan. 10, 2023.

[85] A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger, B. Valiron, “Quipper: a scalable quantum programming language,” in Proc. the 34th ACM SIGPLAN Conf. on Programming language design and implementation: 333-342, 2013.

[86] “Language-Integrated Quantum Operations: LIQUi|>,” Microsoft Research. Last accessed: Jan. 10, 2023.

[87] S. Patil, A. JavadiAbhari, C. F. Chiang, J. Heckey, M. Martonosi, F. T. Chong, “Characterizing the performance effect of trials and rotations in applications that use Quantum Phase Estimation,” in Proc. 2014 IEEE Int. Symposium on Workload Characterization (IISWC): 181-190, 2014.

[88] M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information: 10Th Anniversary Edition. Cambridge, England: Cambridge University Press, 2010.

[89] S. Imre, “Quantum computing and communications – Introduction and challenges,” Comput. Electr. Eng., 40(1): 134-141, 2014.

[90] P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. 35th Annu. Symposium on Foundations of Computer Science: 124-134, 1994.

[91] L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proc. the twenty-eighth Annu. ACM symposium on Theory of computing: 212-219, 1996.

[92] L. K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Phys. Rev. Lett., 79(2): 325-328, 1997.

[93] D. J. Bernstein, “Grover vs. mceliece,” in Third Int. Workshop on Post-Quantum Cryptography: 73-80, 2010.

[94] P. Wang, S. Tian, Z. Sun, N. Xie, “Quantum algorithms for hash preimage attacks,” Quantum Eng., 2(2): 2020.

[95] X. Dong, S. Sun, D. Shi, F. Gao, X. Wang, L. Hu, “Quantum collision attacks on AES-like hashing with low quantum random access memories,” in Proc. 26th Int. Conf. on the Theory and Application of Cryptology and Information Security: 727-757, 2020.

[96] D. J. Bernstein, “Introduction to post-quantum cryptography,” in Post-Quantum Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 1-14, 2009.

[97] J. Watrous, “Zero-Knowledge against Quantum Attacks,” SIAM j. comput., 39(1): 25-58, 2009.

[98] E. Kashefi, I. Kerenidis, “Statistical Zero Knowledge and quantum one-way functions,” Theor. Comput. Sci., 378(1): 101-116, 2007.

[99] S. J. Chang et al., “Third-round report of the SHA-3 cryptographic hash algorithm competition,” National Institute of Standards and Technology, Gaithersburg, MD, Rep. 7896, Nov. 2012.

[100] U. Rührmair et al., “Efficient Power and Timing Side Channels for Physical Unclonable Functions,” in Proc. 16th Int. Workshop on Cryptographic Hardware and Embedded Systems, 476-492, 2014.

[101] J. P. Aumasson, W. Meier, R. C. W. Phan, L. Henzen, The hash function BLAKE. Springer-Verlag Berlin Heidelberg, 2014.

[102] A. Bauer, E. Jaulmes, E. Prouff, J.-R. Reinhard, J. Wild, “Horizontal collision correlation attack on elliptic curves: - Extended Version -,” Cryptogr. Commun., 7(1): 91-119, 2015.

[103] S. Y. Yan, Cryptanalytic attacks on RSA. Springer, 2008.

[104] S. Contini, A. K. Lenstra, R. Steinfeld, “VSH, an efficient and provable collision-resistant hash function,” in Proc. 25th Int. Conf. on the Theory and Applications of Cryptographic Techniques: 165-182, 2006.

[105] M. J. O. Saarinen, “Security of VSH in the real world,” in Proc. 7th Int. Conf. on Cryptology in India: 95–103, 2006.

[106] ISO/IEC 10118-4:1998 Information technology — Security techniques — Hash-functions — Part 4: Hash-functions using modular arithmetic, ISO/IEC 10118-4:1998, Dec. 1998.

[107] S. Kölbl, E. Tischhauser, P. Derbez, A. Bogdanov, “Troika: a ternary cryptographic hash function,” Des. Codes Cryptogr., 88(1): 91-117, 2020.

[108] N. Mishra, S. H. Islam, S. Zeadally, “A comprehensive review on collision-resistant hash functions on lattices,” J. Inf. Secur. Appl., 58: 102782, 2021.

[109] V. Manuceau, “About a fast cryptographic hash function using cellular automata ruled by far-off neighbours,” Int. j. eng. trends technol., 69(2): 39-41, 2021.

[110] J. S. Teh, K. Tan, M. Alawida, “A chaos-based keyed hash function based on fixed point representation,” Cluster Comput., 22(2): 649-660, 2018.

[111] M. Zohner, M. Kasper, M. Stöttinger, S. A. Huss, “Side channel analysis of the SHA-3 finalists,” in Proc. 2012 Design, Automation & Test in Europe Conf. & Exhibition (DATE): 1012-1017, 2012.

[112] C. Herder, M. D. Yu, F. Koushanfar, S. Devadas, “Physical unclonable functions and applications: A tutorial,” Proc. IEEE. Electr. Electron. Eng., 102(8): 1126-1141, 2014.

[113] T. F. Lee, W. Y. Chen, “Lightweight fog computing-based authentication protocols using physically unclonable functions for internet of medical things,” J. Inf. Secur. Appl., 59: 102817, 2021.

[114] A. P. Fournaris, N. Sklavos, “Secure embedded system hardware design – A flexible security and trust enhanced approach,” Comput. Electr. Eng., 40(1): 121-133, 2014.

[115] U. Rührmair, D. E. Holcomb, “PUFs at a glance,” in 2014 Design, Automation & Test in Europe Conf. & Exhibition (DATE): 1-6, 2014.

[116] C. Helfmeier, C. Boit, D. Nedospasov, J. P. Seifert, “Cloning physically unclonable functions,” in 2013 IEEE Int. Symposium on Hardware-Oriented Security and Trust (HOST): 1-6, 2013.

[117] U. Rührmair, J. Sölter, “PUF modeling attacks: An Introduction and overview,” in Proc. 2014 Design, Automation & Test in Europe Conf. & Exhibition (DATE): 1-6, 2014.

[118] J. Delvaux, I. Verbauwhede, “Side channel modeling attacks on 65nm arbiter PUFs exploiting CMOS device noise,” in Proc. 2013 IEEE Int. Symposium on Hardware-Oriented Security and Trust (HOST): 137-142, 2013.

[119] A. Mahmoud, U. Rührmair, M. Majzoobi, F. Koushanfar, “Combined modeling and side channel attacks on strong PUFs,” Cryptology ePrint Archive, 2013.

[120] Y. Gao, S. F. Al-Sarawi, D. Abbott, “Physical unclonable functions,” Nat. Electron., 3(2): 81-91, 2020.

[121] Y. G. Yang, J. R. Dong, Y. L. Yang, Y. H. Zhou, W. M. Shi, “Usefulness of decoherence in quantum-walk-based hash function,” Int. J. Theor. Phys., 60(3): 1025-1037, 2021.

[122] M. Ziiatdinov, “Quantum Hashing. Group approach,” Lobachevskii J. Math., 37(2): 222-226, 2016.

[123] H. Buhrman, R. Cleve, J. Watrous, R. de Wolf, “Quantum fingerprinting,” Phys. Rev. Lett., 87(16), 2001.

[124] F. Ablayev, A. Vasiliev, “Quantum hashing,” Cornell University Library, arXiv:1310.4922 [quant-ph], 2013.

[125] F. Ablayev, M. Ablayev, “Quantum hashing via ε-Universal hashing constructions and freivalds’ fingerprinting schemas,” in Proc. 16th Int. Workshop on Descriptional Complexity of Formal Systems: 42-52, 2014.

[126] F. Ablayev, M. Ablayev, A. Vasiliev, “On the balanced quantum hashing,” J. Phys. Conf. Ser., 681(1): 012019, 2016.

[127] L. Ren, S. Devadas, “Bandwidth hard functions for asic resistance,” in Proc. Theory of Cryptography Conf.: 466-492, 2017.

[128] C. Percival, Stronger key derivation via sequential memory-hard functions. 1-16, 2009. Last accessed: Jan. 10, 2023.

[129] C. Percival, S. Josefsson, The scrypt password-based key derivation function. Internet Engineering Task Force (IETF), No. rfc7914, Aug. 2016.

[130] X. Li, Z. Shao, M. Zhu, J. Yang, Fundamentals of optical computing technology: forward the next generation supercomputer. Singapore: Springer, 2018.

[131] W. He, X. Peng, “Optical one-way hash function,” In: Advanced Secure Optical Image Processing for Communications, Al Falou, A. ed. IOP Publishing. 2018.

[132] W. Q. He, J. Y. Chen, L. B. Zhang, D. J. Lu, M.-H. Liao, X. Peng, “Optical Hash function based on multiple scattering media,” Acta Physica Sinica, 70(5): 054203, 2021.

[133] A. Kumar, A. Fatima, N. K. Nishchal, “An optical Hash function construction based on equal modulus decomposition for authentication verification,” Opt. Commun., 428: 7-14, 2018.

[134] L. D. Tsobdjou, S. Pierre, A. Quintero, “A new mutual authentication and key agreement protocol for mobile client—server environment,” IEEE trans. netw. serv. manag., 18(2): 1275-1286, 2021.

[135] P. Kocher, J. Jaffe, B. Jun, P. Rohatgi, “Introduction to differential power analysis,” J. Cryptogr. Eng., 1(1): 5-27, 2011.

[136] S. N. Srirama, M. Jarke, W. Prinz, “Mobile web services mediation framework,” in Proc. the 2nd workshop on Middleware for service oriented computing: held at the ACM/IFIP/USENIX Int. Middleware Conf.: 6-11, 2007.

[137] M. Asif, S. Majumdar, R. Dragnea, “Partitioning the WS execution environment for hosting mobile web services,” in Proc. 2008 IEEE Int. Conf. on Services Computing, vol. 2: 315-322, 2008.

[138] J. Li, W. Zhang, V. Dabra, K. K. R. Choo, S. Kumari, D. Hogrefe, “AEP-PPA: An anonymous, efficient and provably-secure privacy-preserving authentication protocol for mobile services in smart cities,” J. Netw. Comput. Appl., 134: 52-61, 2019.

[139] J. Kong, F. Koushanfar, “Processor-based strong physical unclonable functions with aging-based response tuning,” IEEE Trans. Emerg. Top. Comput., 2(1): 16-29, 2014.

[140] J. P. Aumasson, S. Neves, Z. Wilcox-O’Hearn, C. Winnerlein, “BLAKE2: simpler, smaller, fast as MD5,” in Proc. 11th Int. Conf. on Applied Cryptography and Network Security: 119-135, 2013.

[141] R. Chakraborty, A. Ghosh, V. E. Balas, A. A Elngar, Blockchain: Principles and Applications in IoT. Boca Raton: Chapman and Hall/CRC, 2022.

[142] C. Dobraunig, M. Eichlseder, F. Mendel, M. Schläffer, “Ascon v1.2: Lightweight Authenticated Encryption and Hashing,” J. Cryptol, 34(3), 2021.

[143] P. Podimatas, K. Limniotis, “Evaluating the Performance of Lightweight Ciphers in Constrained Environments-The Case of Saturnin,” Signals, 3(1): 86-94, 2022.

[144] S. Blanc, A. Lahmadi, K. Le Gouguec, M. Minier, L. Sleem, “Benchmarking of lightweight cryptographic algorithms for wireless IoT networks,” Wirel. netw, 28(8): 3453-3476, 2022.

[145] W. K. Lee, K. Jang, G. Song, H. Kim, S. O. Hwang, H. Seo, “Efficient Implementation of lightweight hash functions on GPU and quantum computers for IoT applications,” IEEE Access, 10: 59661-59674, 2022.

[146] J. E. Midwinter, Photonics in Switching, 1st ed. Academic Press, 1993.

LETTERS TO EDITOR

Journal of Electrical and Computer Engineering Innovations (JECEI) welcomes letters to the editor for the post-publication discussions and corrections which allows debate post publication on its site, through the Letters to Editor. Letters pertaining to manuscript published in JECEI should be sent to the editorial office of JECEI within three months of either online publication or before printed publication, except for critiques of original research. Following points are to be considering before sending the letters (comments) to the editor.

[1] Letters that include statements of statistics, facts, research, or theories should include appropriate references, although more than three are discouraged.

[2] Letters that are personal attacks on an author rather than thoughtful criticism of the author’s ideas will not be considered for publication.

[3] Letters can be no more than 300 words in length.

[4] Letter writers should include a statement at the beginning of the letter stating that it is being submitted either for publication or not.

[5] Anonymous letters will not be considered.

[6] Letter writers must include their city and state of residence or work.

[7] Letters will be edited for clarity and length.

Name *

Email Address *

Affiliation *

Comments *

Security Code *

Journal of Electrical and Computer Engineering Innovations (JECEI)

Brand New Categories of Cryptographic Hash Functions: A Survey

References

References

Send comment about this article

Volume 11, Issue 2
July 2023
Pages 335-354

Brand New Categories of Cryptographic Hash Functions: A Survey

References

References

Send comment about this article

Volume 11, Issue 2July 2023Pages 335-354

Volume 11, Issue 2
July 2023
Pages 335-354