Results 31 to 40 of about 20,383 (214)
Analog quantum error correction with encoding a qubit into an oscillator [PDF]
, 2017 To implement fault-tolerant quantum computation with continuous variables, Gottesman-Kitaev-Preskill (GKP) qubits have been recognized as an important technological element. However, the analog outcome of GKP qubits, which includes beneficial information
Fukui, Kosuke +2 more
core +2 more sources
Time Efficient Hash Key Generation for Blockchain Enabled Framework
IEEE AccessBlockchain, in general, helps organizations to improve the transparency and governance by removing its shortfalls and building better control overall. Blockchain network, public or private, is a competent technology when used in order with an optimized ...
Shyam Kumar Sinha, Debarka Mukhopadhyay
doaj +1 more source
Research Ready Data Lakes: Protecting Privacy in Relatable Datasets
International Journal of Population Data Science, 2019 Background with rationale The Georgia Policy Labs’ mission is to improve outcomes for children and families by producing rigorous research with long-term government partners.
Robert McMillan, Maggie Reeves
doaj +1 more source
Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]
, 2010 In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir +6 more
core +2 more sources
The analysis of double hashing
Journal of Computer and System Sciences, 1978 In this paper we analyze the performance of double hashing, a well-known hashing algorithm in which we probe the hash table along arithmetic progressions where the initial element and the increment of the progression are chosen randomly and independently depending only on the key \(K\) of the search.
Guibas, Leo J., Szemeredi, Endre
openaire +2 more sources
Generic Attacks on Double Block Length Sponge Hashing
IACR Transactions on Symmetric CryptologyThe sponge construction is one of the main modes of operation for hash functions. Using a permutation of width b = r + c, the sponge construction with rate r and capacity c is indifferentiable up to Ω(2c/2) permutation calls.
Gaëtan Leurent, César Mathéus
doaj +1 more source
RiffleScrambler - a memory-hard password storing function
, 2018 We introduce RiffleScrambler: a new family of directed acyclic graphs and a corresponding data-independent memory hard function with password independent memory access. We prove its memory hardness in the random oracle model. RiffleScrambler is similar
D Aldous +6 more
core +1 more source
Double hashing thresholds via local weak convergence [PDF]
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013 A lot of interest has recently arisen in the analysis of multiple-choice "cuckoo hashing" schemes. In this context, a main performance criterion is the load threshold under which the hashing scheme is able to build a valid hashtable with high probability in the limit of large systems; various techniques have successfully been used to answer this ...
openaire +2 more sources
Advanced Science, EarlyView.Time‐restricted feeding (TRF) exerts protein‐dependent neuroprotective effects in an MPTP‐induced Parkinson's disease model. In casein‐fed mice, TRF improves gut barrier integrity and reduces neuroinflammation, possibly via modulation of Allobaculum and BCAAs.
Ting Li +12 more
wiley +1 more source
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
, 2013 Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +1 more source