Results 251 to 260 of about 2,746,805 (293)

Cryptographic hash functions

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   +1 more source

On the security of the visual hash function

Journal of Electronic Imaging, 2005
Robust hash functions are central to the security of multimedia content authentication systems. Such functions are sensitive to a key but are robust to many allowed signal processing operations on the underlying content. The robustness of the hash function to changes in the original content implies the existence of a cluster in the feature space around
Regunathan Radhakrishnan, Ziyou Xiong, Nasir D. Memon   +2 more
openaire   +2 more sources

RC4-Hash: A New Hash Function Based on RC4

2006
In this paper, we propose a new hash function based on RC4 and we call it RC4-Hash. This proposed hash function produces variable length hash output from 16 bytes to 64 bytes. Our RC4-Hash has several advantages over many popularly known hash functions. Its efficiency is comparable with widely used known hash function (e.g., SHA-1).
Donghoon Chang, Kishan Chand Gupta, Mridul Nandi   +2 more
openaire   +1 more source

Logical Analysis of Hash Functions

2005
In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducing cryptanalysis problems to the satisfiability problem. The approach is general, elegant, and does not require any human expertise on the construction of a specific cryptographic ...
Dejan Jovanovic, Predrag Janicic
openaire   +2 more sources

Proposals for Iterated Hash Functions

2008
The past few years have seen an increase in the number of attacks on cryptographic hash functions. These include attacks directed at specific hash functions, and generic attacks on the typical method of constructing hash functions. In this paper we discuss possible methods for protecting against some generic attacks.
Lars R. Knudsen, Søren S. Thomsen
openaire   +3 more sources

Universal hash functions for an infinite universe and hash trees

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the design of special hash functions for multiple hash tables

2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), 2012
One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special
openaire   +1 more source

Universal Hash-Function Families: From Hashing to Authentication

2014
Due to their potential use as building blocks for constructing highly efficient message authentication codes (MACs), universal hash-function families have been attracting increasing research attention, both from the design and analysis points of view.
openaire   +2 more sources

Hash Function

2021
Seong Oun Hwang, Intae Kim, Wai Kong Lee
openaire   +1 more source

Hashing functions

The Computer Journal, 1975
openaire   +2 more sources