Abstract
he report will present a comparison of practical effectiveness several methods for generating random finite quasigroups. Namely, consider quasigroups obtained from regular families functions, feedback shift registers, generalized networks Feistel, as well as those generated by the Jacobson Matthews method. The cardinalities of the obtained sets of quasigroups and the average time algorithms for different parameters.
Publisher
Keldysh Institute of Applied Mathematics
Reference5 articles.
1. Глухов М. М., О применениях квазигрупп в криптографии // Прикладная дискретная математика. — 2008. — № 2. — C. 28–32.
2. Jacobson M. T.,Matthews P., Generating uniformly distributed random Latin squares // Journal of Combinatorial Designs. — 1996. — Vol. 4, no. 6. — P. 405–437
3. Galatenko A. V., Pankratiev A. E., Staroverov V. M. Generation of proper families of functions // Lobachevskii Journal of Mathematics. — 2022. — Vol. 43, no. 3. — P. 571–581
4. Галатенко А. В., Носов В. А., Панкратьев А. Е. Построение подстановок с полным дифференциалом // Мат-лы XIII Международного семинара «Дискретная математика и ее приложения» имени академика О. Б. Лупанова. — М.: Изд-во механико-математического факультета МГУ, 2019. — С. 317–319.
5. Ryser H. J., Permanents and systems of distinct representatives // Proc. of the Conference on Combinatorial mathematics and its applications. — University of North Carolina, 1967. — P. 55–70