Skip to main content
Log in

Comparing Finite Abelian Groups from the Standpoint of Their Cryptographic Applications

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. A. Fisher and F. Yates, Statistical Tables for Biological, Agricultural and Medical Research, Oliver & Boyd, London (1948), pp. 26–27.

    MATH  Google Scholar 

  2. M. M. Glukhov, “On 2-transitive products of regular permutation groups,” Tr. Diskr. Mat., 3, 37–52 (2000).

    Google Scholar 

  3. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA (1969), pp. 124–125.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Galatenko.

Additional information

Deceased (A. A. Nechaev).

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 20, No. 1, pp. 9–16, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-017-3362-z

Navigation