Universal hashing in VLSI

2006 ◽  
pp. 312-318 ◽  
Author(s):  
Martin Fürer
Keyword(s):  
Universal Hashing

Universal hashing

2018 ◽  
pp. 93-96
Author(s):  
Juergen Bierbrauer
Keyword(s):  
Universal Hashing

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash

2021 ◽  
Vol 21 (3&4) ◽  
pp. 0181-0202
Author(s):  
Khodakhast Bibak ◽  
Robert Ritchie ◽  
Behrouz Zolfaghari
Keyword(s):  
Hash Function ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Privacy Amplification ◽  
Universal Hashing ◽  
Wide Range ◽  
Strong Property ◽  
Everlasting Security ◽  
Universal Hash Function ◽  
General Method

Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of $\varepsilon$-almost-$\Delta$-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an $\varepsilon$-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.

scholarly journals A trade-off between collision probability and key size in universal hashing using polynomials

2010 ◽  
Vol 58 (3) ◽  
pp. 271-278 ◽  
Author(s):  
Palash Sarkar
Keyword(s):  
Collision Probability ◽  
Trade Off ◽  
Universal Hashing

Energy Scalable Universal Hashing

2005 ◽  
Vol 54 (12) ◽  
pp. 1484-1495 ◽  
Author(s):  
J. Kaps ◽  
K. Yuksel ◽  
B. Sunar
Keyword(s):  
Universal Hashing

scholarly journals Faster 64-bit universal hashing using carry-less multiplications

2015 ◽  
Vol 6 (3) ◽  
pp. 171-185 ◽  
Author(s):  
Daniel Lemire ◽  
Owen Kaser
Keyword(s):  
Universal Hashing
Sign in / Sign up

Export Citation Format

Share Document