Estimation of the number of ``good permutations with applications to cryptography

DOI10.1007/BF02733401MaRDI QIDQ1580181zbMATH OpenFDO

Authors I. M. Kovalenko, Colin Cooper, Robert Gilchrist, D. Novakovich

Publication date 18 January 2001

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02733401

zbMATH Keywords

cipher systemscryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Estimating the number of good permutations by a modified fast simulation method
• Encoding and classification of permutations by special conversion with estimates of class power
• Applying fast simulation to find the number of good permutations
• Pseudorandom permutation
• Using the Monte Carlo method for fast simulation of the number of ``good permutations on the SCIT-4 multiprocessor computer complex

Cited in

(18)

• 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
• Additive triples of bijections, or the toroidal semiqueens problem
• Lower bounds for key length of k-wise almost independent permutations and certain symmetric-key encryption schemes
• 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
• On the maximum number of Latin transversals
• Encoding and classification of permutations by special conversion with estimates of class power
• Accord advantage equivalent class of permutation and its properties
• scientific article; zbMATH DE number 1959632 (Why is no real title available?)
• The action of a few random permutations on r-tuples and an application to cryptography
• On a mnemonic construction of permutations
• 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

This page was built for publication: Estimation of the number of ``good permutations with applications to cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580181)