# Statistical Methods for Cryptography

• Alfredo Rizzi
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)

## Abstract

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 = 0,1,\ldots ,m - 1)$$ with probability 1 ∕ m and let the second s.v. Y assume the value i with probability $$({p}_{i}\,:\,\sum\limits_{i=1}^{m-1}{p}_{i} =\ 1,{p}_{i}\,\geq \,0)$$. If the s.v. $$Z = X + Y$$ (mod m) is uniformly distributed and m is a prime number, at least one of the two s. v. X and Y is uniformly distributed.

## Keywords

Prime Number Composite Number Modular Arithmetic Stock Holding Deterministic Test
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. Agrawal, M., Kayal, N., & Saxena, N. (2004). Primes in p. Annals of Mathematics, 160, 781–793.
2. Goldwasser, S., & Kilian, J. (1986) Almost all primes can be quickly certified. In Proceedings of the eighteenth annual ACM symposium on Theory of Computing (pp. 316–329). New York: ACM Press.
3. Pomerance, C., Selfridge, J. L., & Wagstaff, Jr., S. S. (1980). The pseudoprimes to 25 ×109. Mathematics of Computation, 35, 1003–1026.
4. Rizzi, A. (1990). Some theorem on the sum modulo m of two independent random variables. Metron, 48, 149–160.
5. Scozzafava, P. (1991). Sum and difference modulo m between two independent random variables. Metron, 49, 495–511.