T₅: Hashing Five Inputs with Three Compression Calls.

In particular, it provides birthday security for hashing 5 inputs using three 2n-to-n compression calls, instead of only 4 inputs in prior constructions. ... Thus, we get a sequential variant of the Merkle-Damgård (MD) hashing, where t message blocks are hashed using only 3t/4 calls to the 2n-to-n compression functions; a 25% saving over traditional hash function ... The T5 construction with five message blocks m1, m2, m3, m4, m5 and three compression function calls. improving over the state-of-the-art of Merkle-Damgård (with IV counted as message block) and Merkle ...

dblp:journals/iacr/DodisKMN21 fatcat:5br76hzzmfhcnb5eqts3bgetay

In particular, it provides birthday security for hashing 5 inputs using three 2n-to-n compression calls, instead of only 4 inputs in prior constructions. ... Given 2n-to-n compression functions h₁,h₂,h₃, we build a new 5n-to-n compression function T₅, using only 3 compression calls: T₅(m₁, m₂, m₃, m₄, m₅) : = h₃(h₁(m₁, m₂)⊕ m₅ , h₂(m₃, m₄)⊕ m₅) ⊕ m₅ We prove ... The T5 construction was first presented there by one of the authors of this paper, and the fruitful discussions there provided an initial starting point for this paper. ...

doi:10.4230/lipics.itc.2021.24 fatcat:7d63r5wwqnadppm6exsonbdlqq

Open Access

We shortly discuss these properties with respect to three existing approaches and finally have a detailed view on the promising approach sdhash. ... Compression and ease of computation are borrowed from traditional hash functions and define the hash value length and the performance. ... B L−1 called input. • f k is a sub byte string in IN starting at offset k with a length of l. We call f a feature. ...

doi:10.1109/issa.2012.6320445 dblp:conf/issa/BreitingerB12 fatcat:eviiraybevh37pcsqqcrzcuskq

In this paper I will discuss the requirements for a secure hash function and relate my attempts to come up with a "toy" system which both reasonably secure and also suitable for students to work with by ... Secure hash functions are the unsung heroes of modern cryptography. ... The output of the compression function, called the chaining value, is used as one of the inputs to the next compression function. ...

doi:10.1080/01611194.2012.687429 fatcat:jy2ccunnfzb2xn2jc4gmb5rjvy

Rivest in response to the call for proposals for a SHA-3 cryptographic hash algorithm by the National Institute of Standards and Technology. ... Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. The MD6 hash function is developed by a team led by Professor Ronald L. ... Note that when L=0, the input is divided into 48-word (three-chunk, 3072 bits) data-blocks. ...

doi:10.1109/icess.2009.37 dblp:conf/icess/GaoWOL09 fatcat:fd2gidvvlvbgvatksup2mwu6ty

It is based on the idea of majority voting in conjunction with run length encoding to compress the input data and uses Bloom filters to represent the fingerprint. It is therefore called mvHash-B. ... Additionally the hash value length is approximately 0.5% of the input length and hence outperforms most existing algorithms. ... As we use a majority vote approach to compress the input and Bloom filters to represent the digest we call our approach mvHash-B which is available to download 1 . ...

doi:10.1109/imf.2013.18 dblp:conf/imf/BreitingerABB13 fatcat:t2eurzxh6zhv7ieev3gdwudlke

Also, rules to design "good" hash functions are now known and are followed in every reasonable proposal of a new hash scheme. ... Here, we exploit a hybrid meta-heuristic for the evolutionary process called Gene Expression Programming (GEP) [2] that appeared far more efficient computationally speaking compared to the GP paradigm ... Formally speaking, a hash function H : {0, 1} * −→ { 0, 1} n maps a binary string of arbitrary length into a binary string of some fixed length n (often called footprint) with at least the compression ...

doi:10.2478/v10065-012-0027-x fatcat:4hibfnax6fda5mi24bp2rbheim

Open Access

It is implemented through three stages: sequence information extraction, sequence information matching, and sequence information encoding. ... With the maturity of genome sequencing technology, huge amounts of sequence reads as well as assembled genomes are generating. ... entities with the identical hash value exist. ...

doi:10.1155/2019/3108950 pmid:31915686 pmcid:PMC6930768 fatcat:n3aqpkganbfp7idag2zvvb4kvu

DOAJ

Rather than exploit specific value redundancy with compression, as in previous work, our scheme detects duplicate data blocks and stores only one copy of the data in a way that can be accessed through ... This tag array is a 4-way set-associative structure, with three sets. ... For the hash function, we use five-level exclusive-OR gates using the same technology used for hashing long branch history for high-performance branch predictors [35] . ...

doi:10.1145/2597652.2597655 dblp:conf/ics/TianKJL14 fatcat:csm2wuew6bdz7lmry3x6yynfvu

In this work, we consider the processing of SPARQL queries with Apache Spark. ... We propose and compare five different query processing approaches based on different join execution models and Spark components. ... SPARQL Hybrid also saves on the number of data accesses: two against three and five for respectively SPARQL RDD and SPARQL DF. ...

arXiv:1604.08903v2 fatcat:476zynifujglffe5qmonprbjlu

Multiple Versions

Approximate matching functions, also called similarity preserving or fuzzy hashing functions, try to achieve that goal by comparing files and determining their resemblance. ... A full description of the multi-thread implementation of the algorithm is included, along with all the tests employed for comparing this proposal with ssdeep, sdhash, and LZJD. ... Efficiency Tests This test is composed of three parts suitably called runtime efficiency, fingerprint comparison, and compression [4] . ...

doi:10.3390/math8040503 fatcat:uzua7xzd2zedtmv2bkrjtsahla

DOAJ Szczepanski

In contrast, inputs have been constructed leading to much worse expected performance with some of the classic primality based 2-universal hashing schemes. ... In the context of linear probing, we compare our new fast 5-universal hashing experimentally with the fastest known plain universal hashing. ... Some of the derived characters may be input characters, and those that are not, are called new. 2. ...

doi:10.1137/1.9781611972900.7 dblp:conf/alenex/ThorupZ10 fatcat:5udf2dlvnngmjd3b264b63rsty

This illustrates the advantage of using schemes with provably good expected performance for all inputs. * Preliminary parts of this work were presented at SODA'04 [30] and at ALENEX'10 [31]. ... In particular, we give realistic examples of inputs that make the most popular 2-independent hash function perform quite poorly. ... called a "sketch"). ...

doi:10.1137/100800774 fatcat:xxcubh3enbbqbeq7rl67dnkfye

algorithm when cluster configuration is in compressed mode. ... HBase cluster configuration First, in consideration of the performance conditions such as compression ratio, compression rate, and decompression rate, we expect to balance the I/O and CPU and select Snappy ...

doi:10.1186/s13638-017-0827-1 fatcat:xkedul4vzjghjkdz35uhfchi24

DOAJ

We have evaluated the performance using a prototype system called DynamiTE , which organizes the knowledge bases with a number of indices to facilitate the query process and exploits parallelism to improve ... In this context, materializing every possible implicit derivation from a given input can be computationally expensive, especially when considering large data volumes. ... input are marked with a step of zero). ...

doi:10.1007/978-3-642-41335-3_41 fatcat:ns2v6wqukbfcbbgsw36fl7ifpe

T5: Hashing Five Inputs with Three Compression Calls [article]

Preserved Fulltext