Filters








22,971 Hits in 3.1 sec

Empirical Evaluation of Hash Functions for PacketID Generation in Sampled Multipoint Measurements [chapter]

Christian Henke, Carsten Schmoll, Tanja Zseby
2009 Lecture Notes in Computer Science  
In a previous paper we already evaluated hash functions for hash-based selection. In this paper we analyze hash functions for packet ID generation.  ...  When hash-based selection is applied two hash values are generatedone on which the selection decision is based and a second one that is used as the packet ID.  ...  Selection Range Adjustment for One Hash Function.  ... 
doi:10.1007/978-3-642-00975-4_20 fatcat:r25jx6xhdnfqtoujvnemvtdq64

Cryptographic hash standards: where do we go from here?

W.E. Burr
2006 IEEE Security and Privacy  
The attacks have triggered a kind of feeding frenzy in the cryptographic community; many researchers are now working on hash function attacks, and we can expect new results in this area for the next several  ...  In this article, I discuss the SHA-1 attack and the US National Institute of Standards and Technology's (NIST's) plans for SHA-1 and hash functions in general.  ...  In particular, given one collision pair for any Merkle-Damgaard hash, you can concatenate the same value on the end of the message and get another collision.  ... 
doi:10.1109/msp.2006.37 fatcat:4scw26zebjaudkr7x3mwyozht4

A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions

T. MATSUDA, N. ATTRAPADUNG, G. HANAOKA, K. MATSUURA, H. IMAI
2008 IEICE transactions on information and systems  
Instead, we use a target collision resistant hash function, which is a strictly weaker primitive than a collision resistant hash function.  ...  In this paper, we construct a signature scheme which has the same properties as the BSW scheme but does not rely on collision resistant hash functions.  ...  In [26] , it was proved that a collision resistant hash function cannot be constructed from any one-way functions in a black-box manner, while it was already shown in [25] that a universal one-way hash  ... 
doi:10.1093/ietisy/e91-d.5.1466 fatcat:5p5yjm4w65fr5gbpp3scavu7ii

A Bloom Filter with the Integrated Hash Table Using an Additional Hashing Function

Mahmood Ahmadi, Reza Pourian
2015 Network Protocols and Algorithms  
We implemented our approach in a software packet classifier based on tuple space search with the H3 class of universal hashing functions.  ...  Furthermore, we analyze the average bucket size, maximum search length and number of collisions for the proposed approach and compare to the fast hash table (FHT) approach.  ...  Therefore, an additional hashing function selects one address out of k generated addresses.  ... 
doi:10.5296/npa.v7i1.6240 fatcat:jxzskzrs35ea3o2g7kzyyltgx4

Protein Sequence Classification Using Feature Hashing

Cornelia Caragea, Adrian Silvescu, Prasenjit Mitra
2011 2011 IEEE International Conference on Bioinformatics and Biomedicine  
We compare feature hashing with the "bag of kgrams" and feature selection approaches.  ...  , using a hash function, into a lower-dimensional space, i.e., mapping features to hash keys, where multiple features can be mapped (at random) to the same hash key, and "aggregating" their counts.  ...  The features are Algorithm 1 Feature Hashing Input: Protein sequence x; hash functions h and ξ, h : ranked according to a scoring function and the top m best ranked features are selected.  ... 
doi:10.1109/bibm.2011.91 dblp:conf/bibm/CarageaSM11 fatcat:sjtl2bbt3bf45b6i2mrp3rmsga

A Memory-Optimized Bloom Filter Using an Additional Hashing Function

Mahmood Ahmadi, Stephan Wong
2008 IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference  
Utilizing the additional hashing function, only one out of these k memory addresses is selected to store the item only once.  ...  We implemented our approach in a software packet classifier based on tuple space search with the H3 class of universal hashing functions.  ...  Therefore, an additional hashing function utilized to select one of k addresses.  ... 
doi:10.1109/glocom.2008.ecp.476 dblp:conf/globecom/AhmadiW08 fatcat:hm6vhzghbbb3nlxclccy2lolc4

Protein sequence classification using feature hashing

Cornelia Caragea, Adrian Silvescu, Prasenjit Mitra
2012 Proteome Science  
, using a hash function, i.e., by mapping features into hash keys, where multiple features can be mapped (at random) to the same hash key, and "aggregating" their counts.  ...  We compare feature hashing with the "bag of k-grams" approach. Our results show that feature hashing is an effective approach to reducing dimensionality on protein sequence classification tasks.  ...  The features are Algorithm 1 Feature Hashing Input: Protein sequence x; hash functions h and ξ, h : ranked according to a scoring function and the top m best ranked features are selected.  ... 
doi:10.1186/1477-5956-10-s1-s14 pmid:22759572 pmcid:PMC3380737 fatcat:hipcrki6qnhdxetl44ztv5iwcu

Empirical evaluation of hash functions for multipoint measurements

Christian Henke, Carsten Schmoll, Tanja Zseby
2008 Computer communication review  
Hash-based selection is a deterministic packet selection based on a hash function computed on selected parts of the packet content.  ...  In this paper we define a set of quality criteria and select methods to investigate which hash function is most suitable for hash-based packet selection.  ...  A hash function for packet ID generation requires different qualities than the one used for hash-based selection, essentially only hash functions with a low collision probability are useful.  ... 
doi:10.1145/1384609.1384614 fatcat:y7bbide2qzarpcykr5pak2bw4u

The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition [chapter]

Bart Preneel
2010 Lecture Notes in Computer Science  
NIST announced in November 2007 that it would organize the SHA-3 competition, with as goal to select a new hash function family by 2012.  ...  In 1987, Damgård [26] formalized the definition of collision resistance, and two years later Naor and Yung defined a variant of seoncd preimage resistant functions called Universal One Way Hash Functions  ...  Next we describe the status of the three main classes of hash functions: hash functions based on block ciphers, hash functions based on modular arithmetic and dedicated hash functions.  ... 
doi:10.1007/978-3-642-11925-5_1 fatcat:pmaorvizrbghxi2wrtry6i3j7a

Delaying Function Construction Based on Triple DES

Ye Yingze, Zhang Ying
2012 Procedia Engineering  
This paper gives a method of realizing delaying function based on hash collision and the delaying function realized by this method is characterized by safety, high-efficiency and controllable delay.  ...  Delaying function refers to a type of function where the output of the function requires some time, with computational complexity different from cipher.  ...  This paper, based on Triple DES, constructs hash function which can be quickly realized, and the delaying function is further constructed based on the collision of hash function.  ... 
doi:10.1016/j.proeng.2012.01.516 fatcat:vk3bvxrpizdnrixvretgtw6qgq

A framework for the design of one-way hash functions including cryptanalysis of Damgård's one-way function based on a cellular automaton [chapter]

Joan Daemen, René Govaerts, Joos Vandewalle
1993 Lecture Notes in Computer Science  
At Crypto '89 Ivan Damgård [1] presented a method that allows one to construct a computationally collision free hash function that has provably the same level of security as the computationally collision  ...  He also gave three examples of collision free functions to use in this construction. For two of these examples collisions have been found[2] [3] , and the third one is attacked in this paper.  ...  The security of the hash function is based on the fact that collisions for the FI function are of no use in the construction of a collision for the hash function.  ... 
doi:10.1007/3-540-57332-1_7 fatcat:tyb7nhl63rcednbbg3i2e4bodm

Efficient On-line/Off-line Signature Schemes Based on Multiple-Collision Trapdoor Hash Families

L. Harn, W.-J. Hsin, C. Lin
2009 Computer journal  
In this paper, we propose multiple-collision trapdoor hash families based on discrete logarithm and factoring assumptions, and provide formal proofs of their security.  ...  We also introduce an efficient on-line/off-line signature scheme based on our proposed trapdoor hash families.  ...  Krawczyk and Rabin's DL-based trapdoor hash family Krawczyk and Rabin [3] described the trapdoor hash function in H based on DL assumption as follows. Randomly select a large prime q.  ... 
doi:10.1093/comjnl/bxp044 fatcat:iwzxuxz3ubaifmzsc32iq5fbpy

Optimal table lookup for reserved words in Ada

John A. Trono
2006 ACM SIGAda Ada Letters  
Preamble Recently a colleague wanted to include a section on perfect hashing functions in the latest edition of a book [4] , and after an on-line search brought up a reference of mine [8], he sent me an  ...  email asking if I could generate a minimal perfect hashing function (MPHF) for the set of reserved words in Ada 2005.  ...  Hashing is one of the fastest ways to search for information, assuming the specific hashing function, collision resolution strategy and hash table size are all reasonable.  ... 
doi:10.1145/1131411.1131414 fatcat:533j2plifvev5ize2sa75v3svm

A New Hash Competition

William E. Burr
2008 IEEE Security and Privacy  
A collision in an MD hash's overall output implies a collision on the compression function: if it's hard to find compression function collisions, it must also be hard to find hash function collisions.  ...  After almost a decade of comparative analytic quiet, these developments have cast doubt on the security of digital signatures and other hash function applications because they depend on collision resistance  ... 
doi:10.1109/msp.2008.55 fatcat:5ipvzbijufgepnc2r72i6lax7y

Hashing Backoff: A Collision-Free Wireless Access Method [chapter]

Paul Starzetz, Martin Heusse, Franck Rousseau, Andrzej Duda
2009 Lecture Notes in Computer Science  
In this paper, we propose Hashing Backoff, an access method in which stations select backoff values by means of asymptotically orthogonal hashing functions, so that contending stations converge to a collision-free  ...  The fact that the proposed method focuses on reducing collisions makes it particularly interesting for some specific applications such as sensor networks in which eliminating collisions leads to energy  ...  Our idea for a collision-free access method is to construct on the fly orthogonal hash functions for each station by taking into account the inferred state of other stations after each collision.  ... 
doi:10.1007/978-3-642-01399-7_34 fatcat:cz4masjlrndytkqv2cg7eldw7e
« Previous Showing results 1 — 15 out of 22,971 results