where the last equality is based on the distributive law of the modulo operation.
where (9) is based on the distributive law of the modulo operation.
where p represents the operation of modulo p and C l = ∑ n = 0 p − 1 a ( n − l + m 0 ) a n ∗ denotes the cyclic correlation value of the preamble.
for u = 1, 2,…, L. In (14), ψu,v is the sum of the most and least significant bits in the binary representation (in bits) of the modulo-2 u value of v when u ≥ 2 and ψ1,v = 1 by default.
In Section 2 we present a brief overview of the Modulo-PCM encoder.
The trapdoor function is a result of knowing the modulo involved in selecting the keys.
For simplicity of notation, the modulo operation (〈〉 N ) is omitted in the sequel.
Also, denotes the expected value, and represent the real and imaginary parts, respectively, of complex arguments, the modulo operation,, and.
where is the number of users, / the modulo operator, and the floor operator.
To hash values resulting from applying a seed structure to a 2-bit sequence representation, we use the modulo function of the size of the hash table, which is maintained at sizes that are prime numbers to assist in balancing chain sizes.
