Results 11 to 20 of about 552,535 (268)

Cryptographic Hash Functions: Theory and Practice [PDF]

, 2010
Cryptographic hash functions are an essential building block for security applications. Until 2005, the amount of theoretical research and cryptanalysis invested in this topic was rather limited. From the hundred designs published before 2005, about 80% was cryptanalyzed; this includes widely used hash functions such as MD4 and MD5.
Bart Preneel
  +8 more sources

The influence of random number generation in dissipative particle dynamics simulations using a cryptographic hash function. [PDF]

PLoS One, 2021
Okada K, Brumby PE, Yasuoka K.
europepmc   +3 more sources

Key derivation function: key-hash based computational extractor and stream based pseudorandom expander [PDF]

PeerJ Computer Science
The key derivation function is a specific cryptographic algorithm that transforms private string and public strings into one or more cryptographic keys.
Chai Wen Chuah, Nur Ziadah Harun, Isredza Rahmi A. Hamid   +2 more
doaj   +3 more sources

Analysis and implementation of cryptographic hash functions in programmable logic devices / Kriptografinių maišos funkcijų įgyvendinimo programuojamosios logikos lustuose tyrimas

Mokslas: Lietuvos Ateitis, 2016
In this day’s world, more and more focused on data protection. For data protection using cryptographic science. It is also important for the safe storage of passwords for this uses a cryptographic hash function.
Tautvydas Brukštus
doaj   +3 more sources

Cryptanalysis of a Cayley Hash Function Based on Affine Maps in one Variable over a Finite Field [PDF]

arXiv, 2023
Cayley hash functions are cryptographic hashes constructed from Cayley graphs of groups. The hash function proposed by Shpilrain and Sosnovski (2016), based on linear functions over a finite field, was proven insecure. This paper shows that the proposal by Ghaffari and Mostaghim (2018) that uses the Shpilrain and Sosnovski's hash in its construction is
Sosnovski, Bianca
arxiv   +2 more sources

Anti-disassembly using Cryptographic Hash Functions [PDF]

Journal in Computer Virology, 2006
Computer viruses sometimes employ coding techniques intended to make analysis difficult for anti-virus researchers; techniques to obscure code to impair static code analysis are called anti-disassembly techniques. We present a new method of anti-disassembly based on cryptographic hash functions which is portable, hard to analyze, and can be used to ...
John Aycock, Rennie deGraaf, Michael J. Jacobson   +2 more
openalex   +3 more sources

A perceptual hash function to store and retrieve large scale DNA sequences [PDF]

arXiv, 2014
This paper proposes a novel approach for storing and retrieving massive DNA sequences.. The method is based on a perceptual hash function, commonly used to determine the similarity between digital images, that we adapted for DNA sequences. Perceptual hash function presented here is based on a Discrete Cosine Transform Sign Only (DCT-SO).
Bailly, Xavier, De Herve, Jocelyn De Goer, Kang, Myoung-Ah, Nguifo, Engelbert Mephu   +3 more
arxiv   +2 more sources

A Family of Fast Syndrome Based Cryptographic Hash Functions [PDF]

, 2005
Recently, some collisions have been exposed for a variety of cryptographic hash functions~\cite{WFLY04} including some of the most widely used today. Many other hash functions using similar constrcutions can however still be considered secure. Nevertheless, this has drawn attention on the need for new hash function designs. In this article is presented
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier   +2 more
openalex   +9 more sources

SMASH – A Cryptographic Hash Function [PDF]

, 2005
This paper presents a new hash function design, which is different from the popular designs of the MD4-family. Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1, and on RIPEMD, there is a need to consider other hash function design strategies. The paper presents also a concrete hash function design named SMASH.
Lars R. Knudsen
openalex   +4 more sources

Cryptographic Hash Function using Cellular Automata [PDF]

International Journal of Computer Applications Technology and Research, 2016
Since two distinct messages are extremely unlikely to generate identical message digests, one can use this property of cryptographic hash functions to detect when a message has been altered. If one takes a binary file and computes a digest of the file, one can record this baseline digest. In the future, the digest can be recomputed on the file.
Mohamed Mahmoud ElRakaib
openalex   +2 more sources