Zolfaghari Behrouz, Bibak Khodakhast, Koshiba Takeshi
Cyber Science Lab, School of Computer Science, University of Guelph, Guelph, ON N1G 2W1, Canada.
Department of Computer Science and Software Engineering, Miami University, Oxford, OH 45056, USA.
Entropy (Basel). 2022 Jul 4;24(7):928. doi: 10.3390/e24070928.
Many security-related scenarios including cryptography depend on the random generation of passwords, permutations, Latin squares, CAPTCHAs and other types of non-numerical entities. Random generation of each entity type is a different problem with different solutions. This study is an attempt at a unified solution for all of the mentioned problems. This paper is the first of its kind to pose, formulate, analyze and solve the problem of as the general problem of generating random non-numerical entities. We examine solving the problem via connecting it to the well-studied problem. To this end, we highlight the challenges and propose solutions for each of them. We explain our method using a case study; random Latin square generation.
包括密码学在内的许多与安全相关的场景都依赖于密码、排列、拉丁方、验证码及其他类型非数字实体的随机生成。每种实体类型的随机生成都是一个不同的问题,有着不同的解决方案。本研究旨在为上述所有问题提供一个统一的解决方案。本文首次提出、阐述、分析并解决了作为生成随机非数字实体的一般问题。我们通过将其与已得到充分研究的问题相联系来探讨该问题的解决方法。为此,我们突出了其中的挑战,并针对每个挑战提出了解决方案。我们通过一个案例研究(随机拉丁方生成)来解释我们的方法。