Results 201 to 210 of about 10,388,112 (269)
Some of the next articles are maybe not open access.
2019
The main topic of this book is implementing hash tables; it’s only secondarily about hash functions. This is why you have assumed a priori that you have uniformly distributed hash keys. In reality, this is unlikely to be the case; real data are rarely random samples from the space of possible data values.
openaire +2 more sources
The main topic of this book is implementing hash tables; it’s only secondarily about hash functions. This is why you have assumed a priori that you have uniformly distributed hash keys. In reality, this is unlikely to be the case; real data are rarely random samples from the space of possible data values.
openaire +2 more sources
Designing an authenticated Hash function with a 2D chaotic map
Nonlinear dynamics, 2021L. G. de la Fraga +2 more
semanticscholar +1 more source
Constructing chaos-based hash function via parallel impulse perturbation
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2021Hongjun Liu, Xing-yuan Wang, A. Kadir
semanticscholar +1 more source
GOST R 34.11-2012: Hash Function
Request for Comments, 2013This document is intended to be a source of information about the Russian Federal standard hash function (GOST R 34.11-2012), which is one of the Russian cryptographic standard algorithms (called GOST algorithms). This document updates RFC 5831.
Vasily Dolmatov, A. Degtyarev
semanticscholar +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.
Shahram Bakhtiari +2 more
openaire +2 more sources
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.
Shahram Bakhtiari +2 more
openaire +2 more sources
IEEE Transactions on Computers, 2005
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Vandierendonck, Hans, De Bosschere, K.
openaire +2 more sources
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Vandierendonck, Hans, De Bosschere, K.
openaire +2 more sources
Brute force attacks on hash functions
Journal of Discrete Mathematical Sciences and Cryptography, 2007We examine preimage, second preimage and collision resistance of cryptoghraphic hash functions for a particular class of brute force attacks.
LACCETTI, GIULIANO, G. Schmid
openaire +5 more sources
Hash Function Vulnerability Index and Hash Chain Attacks [PDF]
2007 3rd IEEE Workshop on Secure Network Protocols, 2007 A hash chain is constructed by repeated hashing from an initial value. While it finds applications for network protocol design it also poses threats to hash function one-way and collision-free properties. We investigate the complexity of breaking hash function security properties by hash chain attacks using probabilistic algorithms.
openaire +1 more source
European Transactions on Telecommunications, 1994
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +2 more sources
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +2 more sources
Modern Cryptography with Proof Techniques and Applications, 2021
S. Hwang, Intae Kim, W. Lee
semanticscholar +1 more source
S. Hwang, Intae Kim, W. Lee
semanticscholar +1 more source