Volume : V, Issue : IX, September - 2015

Statistical Methods for Cryptography

Dr. Kishor H Atkotiya

Abstract :

In this paper, 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 – . Let X be uniformly distributed, that is, it assumes the value i(i=0,1,….m–1)with probability 1/m and let the second s.v. Y assume the value i with probability . 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 :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

Dr.Kishor H Atkotiya Statistical Methods for Cryptography Indian Journal of Applied Research, Vol.5, Issue : 9 September 2015

Number of Downloads : 488

References :