Results 111 to 120 of about 123,105 (127)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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
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
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
2020
Don't get intimidated by the title of this chapter. The theory of cryptographic hash functions is not particularly abstruse. What is difficult is the construction of these functions from scratch. However, we need not concern ourselves with this aspect of the mathematical theory since most programming language libraries provide us with a good selection ...
openaire +2 more sources
Don't get intimidated by the title of this chapter. The theory of cryptographic hash functions is not particularly abstruse. What is difficult is the construction of these functions from scratch. However, we need not concern ourselves with this aspect of the mathematical theory since most programming language libraries provide us with a good selection ...
openaire +2 more sources