Results 41 to 50 of about 123,105 (127)

On the Indifferentiability of the Grøstl Hash Function [PDF]

, 2010
The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Andreeva, Elena, Mennink, Bart, Preneel, Bart   +2 more
openaire   +3 more sources

A perceptual hash function to store and retrieve large scale DNA sequences

, 2014
This paper proposes a novel approach for storing and retrieving massive DNA sequences.. The method is based on a perceptual hash function, commonly used to determine the similarity between digital images, that we adapted for DNA sequences.
Bailly, Xavier, De Herve, Jocelyn De Goer, Kang, Myoung-Ah, Nguifo, Engelbert Mephu   +3 more
core  

Hash‐One: a lightweight cryptographic hash function

IET Information Security, 2016
The increased demand for lightweight applications has triggered the need for appropriate security mechanisms in them. Lightweight cryptographic hash functions are among the major responses toward such a requirement. The authors thus have a handful of such hash functions such as QUARK, PHOTON, SPONGENT and GLUON introduced already.
Chungath Srinivasan, Sindhu Manayankath, Puliparambil Megha Mukundan, M. Sethumadhavan   +3 more
openaire   +2 more sources

FSL-BM: Fuzzy Supervised Learning with Binary Meta-Feature for Classification

, 2017
This paper introduces a novel real-time Fuzzy Supervised Learning with Binary Meta-Feature (FSL-BM) for big data classification task. The study of real-time algorithms addresses several major concerns, which are namely: accuracy, memory consumption, and ...
CP Chen, G Qin, J Cargile, J West, JA Evans, JC Bezdek, K Kowsari, L Bahl, M Russo, MJ Prabu, R Vilalta, R Wieland, RAR Ashfaq, S-S Choi, X Jiang, X Qiu   +15 more
core   +1 more source

Asymmetric Deep Supervised Hashing

, 2017
Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many ...
Jiang, Qing-Yuan, Li, Wu-Jun
core   +1 more source

Cryptanalysis of the GOST Hash Function [PDF]

, 2008
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in addition to the common iterative structure, a ...
Kontak, Marcin, Mendel, Florian, Pramstaller, Norbert, Rechberger, Christian, Szmidt, Janusz   +4 more
openaire   +3 more sources

Hash Functions Using Chaotic Iterations

Journal of Algorithms & Computational Technology, 2010
In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proven that, under some conditions, these iterations have a chaotic behavior as defined by Devaney. This chaotic behavior allows us to propose a way to generate new hash functions.
Bahi, Jacques, Guyeux, Christophe
openaire   +7 more sources

Learning to Hash-tag Videos with Tag2Vec

, 2016
User-given tags or labels are valuable resources for semantic understanding of visual media such as images and videos. Recently, a new type of labeling mechanism known as hash-tags have become increasingly popular on social media sites. In this paper, we
Narayanan, PJ, Saini, Saurabh, Shah, Rajvi, Singh, Aditya   +3 more
core   +1 more source

XML data integrity based on concatenated hash function [PDF]

, 2009
Data integrity is the fundamental for data authentication. A major problem for XML data authentication is that signed XML data can be copied to another document but still keep signature valid. This is caused by XML data integrity protecting.
Liu, B, Lu, J, Yip, YJ
core  

Analysis of the Kupyna-256 Hash Function [PDF]

, 2016
The hash function Kupyna was recently published as the Ukrainian standard DSTU 7564:2014. It is structurally very similar to the SHA-3 finalist GrØstl, but differs in details of the round transformations. Most notably, some of the round constants are added with a modular addition, rather than bitwise xor.
Dobraunig, Christoph, Eichlseder, Maria, Mendel, Florian   +2 more
openaire   +2 more sources