On estimation of the probability of absence of collisions of some random mappings
- 21 Downloads
Let X and Y be finite sets and φ: (X,Y) →Y be a mapping. Consider a random mapping i → φ(xi,yi), where xi are arbitrarily chosen from the set X, whereas (yi) is a random sample from Y without replacement. A two-sided bound is derived for the probability of absence of collisions of this mapping. A case of mapping, defined as φ(x, y)=x+ y modulo n, is considered in particular. The results may be used in the selection of identification codes.
Keywordsrandom mapping collision identification code
Unable to display preview. Download preview PDF.
- 1.C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novakovic, “Estimation of the number of “good” permutations, with applications to cryptography,” Kibern. Sist. Anal., No. 5, 10–16 (1999).Google Scholar
- 2.R. Konheim, Cryptography. A Primer, J. Wiley and Sons, Chichester (1991).Google Scholar
- 4.V. F. Kolchin, Random Mappings [in Russian], Nauka, Moscow (1984).Google Scholar
- 5.A. A. Levitskaya, “A combinatorial problem in a class of permutations above a ringZn of odd modulon residues,” Probl. Upravl. Informat., No. 5, 99–108 (1996).Google Scholar