Open Access
Issue
BIO Web Conf.
Volume 97, 2024
Fifth International Scientific Conference of Alkafeel University (ISCKU 2024)
Article Number 00093
Number of page(s) 7
DOI https://doi.org/10.1051/bioconf/20249700093
Published online 05 April 2024
  • X. Wang and H. Yu, “How to break MD5 and other hash functions,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 19–35. [Google Scholar]
  • J. Pieprzyk and B. Sadeghiyan, Eds., Design of hashing algorithms. New York, NY: Springer, 2014. [Google Scholar]
  • P.S.L.M. Barreto and V. Rijmen, “The Whirlpool hashing function”. Primitive submitted to NESSIE, September 2000, revised on May 2003, http://planeta.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html [Google Scholar]
  • U S Department of Commerce and National Institute of St And Tech- nology, Secure hash standard (shs): Federal information processing stan- dards publication 180-4. North Charleston, SC: Createspace Independent Publishing Platform, 2012. [Google Scholar]
  • S.K. Peddoju, H. Upadhyay, and L. Lagos, “File integrity monitoring tools: Issues, challenges, and solutions,” Concurr. Comput., vol. 32, no. 22, 2020. [CrossRef] [Google Scholar]
  • Z.H. Abdullah, N.I. Udzir, R. Mahmod, and K. Samsudin, “Towards a dynamic file integrity monitor through a security classification,” Interna- tional Journal on New Computer Architectures and Their Applications, 2011. [Google Scholar]
  • S.K. Peddoju, H. Upadhyay, and L. Lagos, “File integrity monitoring tools: Issues, challenges, and solutions,” Concurr. Comput., vol. 32, no. 22, 2020. [CrossRef] [Google Scholar]
  • K. Donnelly, Privacy, trust and elements of cryptography in computer security. North Charleston, SC: Createspace Independent Publishing Platform, 2017. [Google Scholar]
  • Y. Dodis, Theory of Cryptography. Heidelberg: Springer, 2015. [Google Scholar]
  • A. Pinheiro, E.D. Canedo, R.T. De Sousa, and R. De Oliveira Albuquerque, “Monitoring file integrity using blockchain and smart contracts,” IEEE Access, vol. 8, pp. 198548–198579, 2020. [CrossRef] [Google Scholar]
  • J. Pieprzyk and B. Sadeghiyan, Eds., Design of hashing algorithms. New York, NY: Springer, 2014. [Google Scholar]
  • M. Sumagita, I. Riadi, J.P.D.S. Sh, and U. Warungboto, “Analysis of secure hash algorithm (SHA) 512 for encryption process on web based application,” International Journal of Cyber-Security and Digital Forensics (IJCSDF), vol. 7, no. 4, pp. 373–381, 2018. [Google Scholar]
  • A. Maetouq, S.M. Daud, N.A. Ahmad, N. Maarop, N.N.A. Sjarif, and H. Abas, “Comparison of hash function algorithms against attacks: A review,” International Journal of Advanced Computer Science and Applications, no. 8, 2018. [Google Scholar]
  • S.D. Almotiri, Forensic Hash Value Guidelines: Why Md5 and SHA1 should no longer be used and a recommendation for their replacement, 2022. [Google Scholar]
  • P.V. Kravchuk, I.D. Gorbenko, and A.I. Pushkaryov, “Analysis of application of hash function in blockchain technology,” Applied radioelectronics, vol. 17, no. 3, 2018. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.