Estimation of the number of ``good permutations with applications to cryptography
From MaRDI portal
Publication:1580181
DOI10.1007/BF02733401zbMath0962.68059MaRDI QIDQ1580181
Igor N. Kovalenko, D. Novakovich, Colin Cooper, Robert Gilchrist
Publication date: 18 January 2001
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Related Items (12)
On the maximum number of Latin transversals ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ A review of my scientific publications. Masters and coworkers ⋮ Works of the Kiev school of theoretical cryptography ⋮ Refining the asymptotic approximation of the group size in the birthday paradox ⋮ Applying fast simulation to find the number of good permutations ⋮ On the number of transversals in Cayley tables of cyclic groups ⋮ Compound orthomorphisms of the cyclic group ⋮ Estimating the number of good permutations by a modified fast simulation method ⋮ Estimating the number of Latin rectangles by the fast simulation method ⋮ On estimation of the probability of absence of collisions of some random mappings ⋮ Calculation of the number of complete mappings for permutations
Cites Work
This page was built for publication: Estimation of the number of ``good permutations with applications to cryptography
