Results 41 to 50 of about 38,362 (243)
Hash‐One: a lightweight cryptographic hash function
The increased demand for lightweight applications has triggered the need for appropriate security mechanisms in them. Lightweight cryptographic hash functions are among the major responses toward such a requirement. The authors thus have a handful of such hash functions such as QUARK, PHOTON, SPONGENT and GLUON introduced already.
Chungath Srinivasan+3 more
openaire +2 more sources
Performance of the most common non-cryptographic hash functions [PDF]
Non-cryptographic hash functions (NCHFs) have an immense number of applications, ranging from compilers and databases to videogames and computer networks. Some of the most important NCHF have been used by major corporations in commercial products. This practical success demonstrates the ability of hashing systems to provide extremely efficient searches
Estébanez, César+3 more
openaire +3 more sources
Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]
In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir+6 more
core +2 more sources
ON THE UNIVERSAL TREE MODE OF HASH CODE GENERATION
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures.
Dmitriy S. Bogdanov+2 more
doaj +1 more source
A trapdoor one-way function for verifiable secret sharing
This paper proposes a (t,n)–threshold verifiable secret sharing scheme with changeable parameters based on a trapdoor one-way function. This scheme consists of a generation phase, a distribution phase, an encoding phase and a reconstruction phase.
Ali Kanso, Mohammad Ghebleh
doaj +1 more source
Cryptographic hash functions for image processing [PDF]
In this paper, a novel algorithm based on hash function for image cryptography is proposed. In this algorithm, the key idea is to encrypt half of the image using data from the second half of the image and then apply it to each other. This scheme can achieve high sensitivity, high complexity, and high security.
openaire +1 more source
Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]
Proceding of: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006.The design of non-cryptographic hash functions by means of evolutionary computation is a relatively new and unexplored problem.
Estébanez Tascón, César+3 more
core +2 more sources
Cryptographic Hash Function using Cellular Automata [PDF]
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
A Survey: Cryptographic Hash Functions for Digital Stamping
The current study aims to examine a general overview of the application of hash functions in cryptography and study the relationships between cryptographic hash functions and uses of the digital signature. Functions of the cryptographic hash are an important tool applied in several sections of data security, and application of hash function is common ...
Israa Ezzat Salem+2 more
openalex +3 more sources
Bad Directions in Cryptographic Hash Functions
A 25-gigabyte “point obfuscation” challenge “using security parameter 60” was announced at the Crypto 2014 rump session; “point obfuscation” is another name for password hashing. This paper shows that the particular matrix-multiplication hash function used in the challenge is much less secure than previous password-hashing functions are believed to be.
Daniel J. Bernstein+4 more
openaire +4 more sources