Results 21 to 30 of about 123,825 (281)

Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]

open access: yes, 2006
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

Challenging the increased resistance of regular hash functions against birthday attacks

open access: yesJournal of Mathematical Cryptology, 2012
At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain.
Mouha Nicky, Sekar Gautham, Preneel Bart
doaj   +1 more source

A secure and efficient cryptographic hash function based on NewFORK-256

open access: yesEgyptian Informatics Journal, 2012
Cryptographic hash functions serve as a fundamental building block of information security and are used in numerous security applications and protocols such as digital signature schemes, construction of MAC and random number generation, for ensuring data
Harshvardhan Tiwari, Krishna Asawa
doaj   +1 more source

Strongly universal string hashing is fast [PDF]

open access: yes, 2014
We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular ...
Kaser, Owen, Lemire, Daniel
core   +2 more sources

MIHash: Online Hashing with Mutual Information [PDF]

open access: yes, 2017
Learning-based hashing methods are widely used for nearest neighbor retrieval, and recently, online hashing methods have demonstrated good performance-complexity trade-offs by learning hash functions from streaming data. In this paper, we first address a
Bargal, Sarah Adel   +3 more
core   +1 more source

Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]

open access: yes, 2017
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core   +1 more source

Integrity verification for digital Holy Quran verses using cryptographic hash function and compression

open access: yesJournal of King Saud University: Computer and Information Sciences, 2020
Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data.
Mishal Almazrooie   +5 more
doaj   +1 more source

Cryptographic Hash Functions: [PDF]

open access: yesIEICE ESS Fundamentals Review, 2010
Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the hash value.
Kan YASUDA, Yu SASAKI
openaire   +4 more sources

Universal hash functions from quantum procedures

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2020
Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj   +1 more source

Dispersing hash functions

open access: yesRandom Structures & Algorithms, 2000
AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy