Results 21 to 30 of about 144,384 (334)
Analysis of the amplitude form of the quantum hash function
In this article, the properties of quantum hash functions are further explored. Previous findings show that so-called small-bias sets (special subsets of the set of elements of a cyclic group) generate a “phase” quantum hash function. Here, it was proved
M. F. Ablayev+2 more
doaj +1 more source
Non-Relaxation Deep Hashing Method for Fast Image Retrieval
Deep hashing methods utilize an end-to-end framework to mutually learn feature representations and hash codes, thereby achieving a better retrieval performance.
Xiaofei Li
doaj +1 more source
Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]
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
Theoretical and Experimental Analysis of Cryptographic Hash Functions
The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions.
Jacek Tchórzewsk+1 more
doaj +1 more source
Electron contact interlayers for low‐temperature‐processed crystalline silicon solar cells
In this study, a series of interlayers are trialed as electron‐selective contacts on crystalline silicon, including several materials that were previously untested in this application. Most of these interlayers were found to achieve mΩcm2‐scale specific contact resistivities.
Jesus Ibarra Michel+11 more
wiley +1 more source
From Graphs to Keyed Quantum Hash Functions [PDF]
We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them.
Ziatdinov, Mansur
core +2 more sources
Challenging the increased resistance of regular hash functions against birthday attacks
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
Hash functions for priority queues
The complexity of priority queue operations is analyzed with respect to the cell probe computational model of A. Yao (J. Assoc. Comput. Mach. 28, No. 3 (1981), 615–628). A method utilizing families of hash functions is developed which permits priority queue operations to be implemented in constant worst-case time provided that a size constraint is ...
M. Fredman, János Komlós, M. Ajtai
openaire +3 more sources
One of the first and most used hashing algorithms in blockchains is SHA-256 so the main aim of this paper is how to increase the security level of the blockchain based on the increasing hashing algorithm security.
Salwa M. Serag Eldin+7 more
doaj +1 more source
EliMAC: Speeding Up LightMAC by around 20%
Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig+2 more
doaj +1 more source