Statistical Methods for Cryptography [chapter]

Alfredo Rizzi
2009 Studies in Classification, Data Analysis, and Knowledge Organization  
In this note, after recalling certain results regarding prime numbers, we will present the following theorem of interest to cryptography: Let two discrete s.v.'s (statistical variable) X , Y assume the value: 0; 1; 2; : : : ; m 1. Let X be uniformly distributed, that is, it assumes the value i.i D 0; 1; : : : ; m 1/ with probability 1=m and let the second s.v. Y assume the value i with probability is uniformly distributed and m is a prime number, at least one of the two s. v. X and Y is
more » ... X and Y is uniformly distributed.
doi:10.1007/978-3-642-03739-9_2 fatcat:xqj7uo7pv5bvflmt7jnxoljoxe