22 papers · ranked by Valyu relevance
Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
Random hashing can provide guarantees regarding the performance of data structures such as hash tables even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random.…
Piyush Kumar Shukla, Amer Aljaedi, Piyush Kumar Pareek, Adel R. Alharbi + 2 more
'Adel R. Alharbi' 'Sajjad Shaukat Jamal' 'Naveen Chilamkurti'] According to the standard paradigm, white box cryptographic primitives are used to block black box attacks and protect sensitive information. This is performed to safeguard the protected information and keys against black box assaults. An adversary in such…
F Martín-Fernández, P Caballero-Gil
On 2nd October 2012 the NIST (National Institute of Standards and Technology) in the United States of America announced the new hashing algorithm which will be adopted as standard from now on. Among a total of 73 candidates, the winner was Keccak, designed by a group of cryptographers from Belgium and Italy. The public…
Robert Primmer, Carl D’Halluin
Centera uses cryptographic hash functions as a means of addressing stored objects, thus creating a new class of data storage referred to as CAS (content addressed storage). Such hashing serves the useful function of providing a means of uniquely identifying data and providing a global handle to that data, referred to…
Abid Hussain, Heng-Chao Li, Muqadar Ali, Samad Wali + 3 more
'Mehboob Hussain' 'Amir Rehman' 'Amelia Carolina Sparavigna'] In recent years, searching and retrieving relevant images from large databases has become an emerging challenge for the researcher. Hashing methods that mapped raw data into a short binary code have attracted increasing attention from the researcher. Most…
Jamshed Khan, Rob Patro, Prashant Pandey
Hash tables are fundamental to computational genomics, where keys are often k-mers—fixed-length substrings that exhibit a “streaming” property: consecutive k-mers share k−1 nucleotides and are processed in order. Existing static data structures exploit this locality but cannot support dynamic updates, while…
Mingyong Li, Ziye An, Qinmin Wei, Kaiyue Xiang + 1 more
In recent years, with the explosion of multimedia data from search engines, social media, and e-commerce platforms, there is an urgent need for fast retrieval methods for massive big data. Hashing is widely used in large-scale and high-dimensional data search because of its low storage cost and fast query speed. Thanks…
Artan Berisha, Behar Baxhaku, Artan Alidema
In this paper, we describe non invertible matrix in GF(2) which can be used as multiplication matrix in Hill Cipher technique for one way hash algorithm. The matrices proposed are permutation matrices with exactly one entry 1 in each row and each column and 0 elsewhere. Such matrices represent a permutation of m…
Andrew Brockmann
We present an explicit formula that produces hash collisions for the Merkle-Damg˚ard construction. The formula works for arbitrary choice of message block and irrespective of the standardized constants used in hash functions, although some padding schemes may cause the formula to fail. This formula bears no obvious…
Iram Bashir, Fawad Ahmed, Jawad Ahmad, Wadii Boulila + 1 more
Image hash is an alternative to cryptographic hash functions for checking integrity of digital images. Compared to cryptographic hash functions, an image hash or a Perceptual Hash Function (PHF) is resilient to content preserving distortions and sensitive to malicious tampering. In this paper, a robust and secure image…
Johnathan Wong, Parham Kazemi, Lauren Coombe, René L. Warren + 1 more
K-mer hashing is a common operation in many foundational bioinformatics problems. However, generic string hashing algorithms are not optimized for this application. Strings in bioinformatics use specific alphabets, a trait leveraged for nucleic acid sequences in earlier work. We note that amino acid sequences, with…
Gizem S. Çetin, Hao Chen, Kim Laine, Kristin Lauter + 2 more
'Yuhou Xia'] Background One of the tasks in the iDASH Secure Genome Analysis Competition in 2016 was to demonstrate the feasibility of privacy-preserving queries on homomorphically encrypted genomic data. More precisely, given a list of up to 100,000 mutations, the task was to encrypt the data using homomorphic…
Ram Kumar Karsh, R. H. Laskar, Bhanu Bhai Richhariya
Background Image authentication is one of the challenging research areas in the multimedia technology due to the availability of image editing tools. Image hash may be used for image authentication which should be invariant to perceptually similar image and sensitive to content changes. The challenging issue in image…
Xiao Chen, Yanlong Li, Chen Chen, Syed Agha Hassnain Mohsan + 2 more
'Wali Ullah Khan' 'Dinh-Thuan Do'] Online hashing is a valid storage and online retrieval scheme, which is meeting the rapid increase in data in the optical-sensor network and the real-time processing needs of users in the era of big data. Existing online-hashing algorithms rely on data tags excessively to construct…
Can Firtina, Nika Mansouri Ghiasi, Joel Lindegger, Gagandeep Singh + 3 more
Nanopore sequencers generate electrical raw signals in realtime while sequencing long genomic strands. These raw signals can be analyzed as they are generated, providing an opportunity for real-time genome analysis. An important feature of nanopore sequencing, Read Until, can eject strands from sequencers without fully…
Gregory A. Landrum, Jessica Braun, Paul Katzberger, Marc T. Lehner + 1 more
Here, we present lwreg, a lightweight, yet flexible chemical registration system supporting the capture of both two-dimensional molecular structures (topologies) and three-dimensional conformers. lwreg is open source, with a simple Python API and is designed to be easily integrated into computational workflows. In…
Oleg Mazonka, Vlad Popov
The concept of ownership implies control. This is true for real objects as well as for abstract concepts like a bank account, copyright or digital data. The examples of owner's actions controlling their assets include transferring ownership to another party at will. However, in reality one's ability to control is…
Giulio Ermanno Pibiri, Rob Patro
Representing a set of k-mers — strings of length k — in small space under fast lookup queries is a fundamental requirement for several applications in Bioinformatics. A data structure based on sparse and skew hashing (SSHash) was recently proposed for this purpose [23]: it combines good space effectiveness with fast…
Matthis Ebel, Giovanna Migliorelli, Mario Stanke
An important initial phase of arguably most homology search and alignment methods such as required for genome alignments is seed finding. The seed finding step is crucial to curb the runtime as potential alignments are restricted to and anchored at the sequence position pairs that constitute the seed. To identify…
Kevin Maik Jablonka, Andrew S. Rosen, Aditi S. Krishnapriyan, Berend Smit
The space of all plausible materials for a given application is so large that it cannot be explored using a brute-force approach. This is, in particular, the case for reticular chemistry which provides materials designers with a practically infinite playground on different length scales. One promising approach to guide…
Daniel Probst, Philippe Schwaller, Jean-Louis Reymond
Predicting the nature and outcome of reactions using computational methods is a crucial tool to accelerate chemical research. The recent application of deep learning-based learned fingerprints to reaction classification and reaction yield prediction has shown an impressive increase in performance compared to previous…
Authors not listed
Because topology plays a key role in many chemical and physical properties of materials, identification of topology from crystalline structures is a common and important task in materials science. We present here a new web application, CrystalNets, whose user-friendly interface allows scientists to identify and…