Results 81 to 90 of about 44,375 (171)

On the Minimum Number of Multiplications Necessary for Universal Hash Functions [PDF]

open access: yes, 2015
Let \(d \ge 1\) be an integer and \(R_1\) be a finite ring whose elements are called block. A \(d\)-block universal hash over \(R_1\) is a vector of \(d\) multivariate polynomials in message and key block such that the maximum differential probability of the hash function is “low”.
openaire   +1 more source

Experimental composable key distribution using discrete-modulated continuous variable quantum cryptography. [PDF]

open access: yesLight Sci Appl
Hajomer AAE   +8 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy