Pages that link to "Item:Q1580181"

The following pages link to Estimation of the number of ``good'' permutations with applications to cryptography (Q1580181):

Displaying 16 items.

• On the maximum number of Latin transversals (Q272327) (← links)
• On a mnemonic construction of permutations (Q515400) (← links)
• Applying fast simulation to find the number of good permutations (Q941195) (← links)
• On the number of transversals in Cayley tables of cyclic groups (Q968119) (← links)
• Compound orthomorphisms of the cyclic group (Q982484) (← links)
• Estimating the number of good permutations by a modified fast simulation method (Q1008305) (← links)
• Estimating the number of Latin rectangles by the fast simulation method (Q1040349) (← links)
• On estimation of the probability of absence of collisions of some random mappings (Q1592011) (← links)
• Calculation of the number of complete mappings for permutations (Q1592100) (← links)
• Additive triples of bijections, or the toroidal semiqueens problem (Q1725577) (← links)
• Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes (Q1800680) (← links)
• A review of my scientific publications. Masters and coworkers (Q2452817) (← links)
• Works of the Kiev school of theoretical cryptography (Q2452821) (← links)
• Refining the asymptotic approximation of the group size in the birthday paradox (Q2452835) (← links)
• (Q4416887) (← links)
• The action of a few random permutations on r-tuples and an application to cryptography (Q4593946) (← links)