Results 51 to 60 of about 569,401 (216)
Distributing hash families with few rows [PDF]
Theoret. Comput. Sci. 800 (2019), 31-41, 2021 Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend ...
arxiv +1 more source
On perfect hashing of numbers with sparse digit representation via multiplication by a constant [PDF]
, 2011 Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set.
Monge, Maurizio
core +2 more sources
Secret sharing scheme based on hashing [PDF]
arXiv, 2023 We propose an adaptive threshold multi secret sharing scheme based solely on cryptographically secure hash functions. We show that the proposed scheme is also: perfect, ideal, verifiable, and proactive. Moreover the proposed scheme has a low computational complexity comparing to the most common schemes operating over finite fields.
arxiv
On randomness in Hash functions [PDF]
, 2012 In the talk, we shall discuss quality measures for hash functions used in data structures and algorithms, and survey positive and negative results. (This talk is not about cryptographic hash functions.) For the analysis of algorithms involving hash ...
Dietzfelbinger, Martin
core +2 more sources
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
, 2017 This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force [PDF]
arXiv, 2023 A minimal perfect hash function (MPHF) maps a set S of n keys to the first n integers without collisions. There is a lower bound of n*log(e)=1.44n bits needed to represent an MPHF. This can be reached by a brute-force algorithm that tries e^n hash function seeds in expectation and stores the first seed leading to an MPHF.
arxiv
Quarterly Journal of the Royal Meteorological Society, EarlyView.This study proposes an approach to account for the spatial and temporal variability in the contribution of surface emissivity error in the data assimilation system by including the surface emissivity as an analysis variable and representing its errors in the ensemble‐based background error covariances matrix within an idealized ensemble‐variational ...
Zheng Qi Wang, Mark Buehner, Yi Huang
wiley +1 more source
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci +7 more
wiley +1 more source
К проблеме хеш-адресации без коллизий постоянного массива ключей [PDF]
, 2007 In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed.
Кузнецов, А. А. +1 more
core
Provably Secure ECC-Based Anonymous Authentication and Key Agreement for IoT
Applied SciencesWith the rise of the Internet of Things (IoT), maintaining data confidentiality and protecting user privacy have become increasingly challenging. End devices in the IoT are often deployed in unattended environments and connected to open networks, making ...
Shunfang Hu +5 more
doaj +1 more source