Abstract
This work presents the results of an experimental study of some properties of low-order finite Abelian groups from the standpoint of the applicability of such groups in cryptographic applications.
Similar content being viewed by others
References
R. A. Fisher and F. Yates, Statistical Tables for Biological, Agricultural and Medical Research, Oliver & Boyd, London (1948), pp. 26–27.
M. M. Glukhov, “On 2-transitive products of regular permutation groups,” Tr. Diskr. Mat., 3, 37–52 (2000).
D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA (1969), pp. 124–125.
Author information
Authors and Affiliations
Corresponding author
Additional information
Deceased (A. A. Nechaev).
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 20, No. 1, pp. 9–16, 2015.
Rights and permissions
About this article
Cite this article
Galatenko, A.V., Nechaev, A.A. & Pankrat’ev, A.E. Comparing Finite Abelian Groups from the Standpoint of Their Cryptographic Applications. J Math Sci 223, 498–503 (2017). https://doi.org/10.1007/s10958-017-3362-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-017-3362-z