A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n

preprint2012arXivOpen access

Abstract

In this note, it is shown that if $f\colon\efq^n\to\efq^n$ is any function and $\bA=(A_1,..., A_n)$ is uniformly distributed over $\efq^n$, then the average over $(k_1,...,k_n)\in \efq^n$ of the Renyi (and hence, of the Shannon) entropy of $f(\bA)+(k_1A_1,...,k_nA_n)$ is at least about log⁡2(qn)−n\log_2(q^n)-n. In fact, it is shown that the average collision probability of $f(\bA)+(k_1A_1,...,k_nA_n)$ is at most about 2n/qn2^n/q^n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.