Results 91 to 100 of about 2,789,044 (190)

CRUSH: A New Cryptographic Hash Function using Iterated Halving Technique

, 2004
. Most of the currently accepted designs for cryptographic hash functions are in the style of a block cipher in feed-forward mode. With increasing interest in all forms of cryptanalysis, this limited choice might become a single point of failure in ...
William L. Millan, Gauravaram, Praveen, Praveen S. S. Gauravaram, Lauren J. May, May, Lauren, Millan, William   +5 more
core  

Quantum Amplitude Hash Function for Quantum Evidence Integrity

IEEE Access
The integrity of evidence, a core principle of digital forensics, is essential for ensuring the reliability and admissibility of evidence in legal proceedings.
Donggun Lee, Hanbeom Shin, Seokhie Hong
doaj   +1 more source

Enhanced image hash using cellular automata with sponge construction and elliptic curve cryptography for secure image transaction

Scientific Reports
With the rapid development of digital communications, sensitive digital storage security, especially that of images, remains a significant challenge.
M. Mohammed Ibrahim, R. Venkatesan, Nasir Ali, Muhammad Imran Qureshi, Hafiz Muhammad Afzal Siddiqui, Fikadu Tesgera Tolasa, Suhad Ali Osman Abdallah   +6 more
doaj   +1 more source

Experimental Evaluation of Avalanche Effect and Hash Consistency in SHA-256, SHA3-256, and BLAKE2b-256 for Smart Grid Data Integrity Verification

Journal of Information Systems and Informatics
Ensuring the integrity of Smart Grid data is essential for preventing unauthorized data modification during transmission and storage. Cryptographic hash functions provide an efficient mechanism for integrity verification; however, their diffusion ...
Muhammad Ridwan, Rusydi Umar, Muhammad Kunta Biddinika, Puguh Wahyu Prasetyo   +3 more
doaj   +1 more source

Cryptographic hash functions: recent design trends and security notions [PDF]

, 2010
Recent years have witnessed an exceptional research interest in cryptographic hash functions, especially after the popular attacks against MD5 and SHA-1 in 2005. In 2007, the U.S.
James H. Davenport, Russell J. Bradford, Bradford, Russell J, Al-Kuwari, Saif, Saif Al-Kuwari, Davenport, James H   +5 more
core  

Cryptographic Hash Functions: Recent Design Trends and Security Notions [PDF]

, 2012
Recent years have witnessed an exceptional research interest in cryptographic hash functions, especially after the popular attacks against MD5 and SHA-1 in 2005. In 2007, the U.S.
Russell J. Bradford, Saif Al-Kuwari, James H. Davenport   +2 more
core  

Performance Analysis of Non-cryptographic Hash Functions for Real-Time Storage and Lookup of URLs.

, 2013
In this work, the performance of various non-cryptographic hash functions has been investigated to identify their random nature when employed in the implementation of hash tables for real-time storage and lookup of uniform resource locators.
Tahir Ahmad, Usman Younis
core   +1 more source

Chromatic Polynomials and Cryptographic Hashing on WIP-Quasigroup Structures

Journal of Mathematics
Cryptographic hash functions are indispensable for today’s information security because they secure data integrity, authentication and encrypted storage.
Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Komiljon Mustafoyev, Samuel Asefa Fufa   +4 more
doaj   +1 more source

An algorithm for generating cryptographically stable S-box optimized for programmable logic integrated circuits

Научно-технический вестник информационных технологий, механики и оптики
Cryptographic primitives implemented on Field-Programmable Gate Array (FPGA) have a number of advantages over their software counterparts; they are more efficient in terms of performance and energy consumption.
I. V. Shibakin, A. B. Levina, M. S. Kupriyanov   +2 more
doaj   +1 more source

Skyscraper: Fast Hashing on Big Primes

Transactions on Cryptographic Hardware and Embedded Systems
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow,
Clémence Bouvier, Lorenzo Grassi, Dmitry Khovratovich, Katharina Koschatko, Christian Rechberger, Fabian Schmid, Markus Schofnegger   +6 more
doaj   +1 more source