Results 271 to 280 of about 159,796 (327)
A novel lightweight medical blockchain data query scheme. [PDF]
Sci RepZhu Y +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the ACM, 1999
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Alon, Noga +4 more
openaire +2 more sources
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Alon, Noga +4 more
openaire +2 more sources
Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
2021
So far we have studied various hash function properties as well as use cases of hash functions. When unkeyed or used with a public key, hash functions can be collision resistant, second-preimage resistant, or one-way.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
So far we have studied various hash function properties as well as use cases of hash functions. When unkeyed or used with a public key, hash functions can be collision resistant, second-preimage resistant, or one-way.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Journal of Information and Optimization Sciences, 2001
RC6 was a candidate encryption algorithm for AES selections which emphasizes on the security, simplicity and performance of the algorithm. The round keys of RC6 are generated from the input key words by a certain amount of “one-way” according to the authors’ claims.
Yi-Shiung Yeh, Jue-Sam Chou
openaire +1 more source
RC6 was a candidate encryption algorithm for AES selections which emphasizes on the security, simplicity and performance of the algorithm. The round keys of RC6 are generated from the input key words by a certain amount of “one-way” according to the authors’ claims.
Yi-Shiung Yeh, Jue-Sam Chou
openaire +1 more source
Cryptographic Hash Functions [PDF]
, 2009 Kryptografiske hashfunktioner anvendes i mange forskellige områder inden for kryptografi: i digitale signatursystemer og i såkaldt public‐key kryptografi, til passwordbeskyttelse og autentificering af beskeder, til dannelse af kryptografiske nøgler og tilfældige tal, osv.
openaire +2 more sources
2015
Cryptographic hash function verifies data integrity and sender identity or source of information. The task is accomplished by taking a variable bit patterns as an input then produces a fixed bit patterns of output. This chapter provides a detailed overview to include classification, properties, constructions, attacks, applications and an overview of a ...
Imad Fakhri Alshaikhli +1 more
openaire +1 more source
Cryptographic hash function verifies data integrity and sender identity or source of information. The task is accomplished by taking a variable bit patterns as an input then produces a fixed bit patterns of output. This chapter provides a detailed overview to include classification, properties, constructions, attacks, applications and an overview of a ...
Imad Fakhri Alshaikhli +1 more
openaire +1 more source
Choosing Best Hashing Strategies and Hash Functions
2009 IEEE International Advance Computing Conference, 2009The paper gives the guideline to choose a best suitable hashing method hash function for a particular problem. After studying the various problem we find some criteria has been found to predict the best hash method and hash function for that problem. We present six suitable various classes of hash functions in which most of the problems can find their ...
Mahima Singh, Deepak Garg
openaire +1 more source
1996
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
S. Bakhtiari +2 more
openaire +1 more source
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
S. Bakhtiari +2 more
openaire +1 more source