Skip to main content
SpringerLink
Log in

Some Homomorphic Cryptosystems Based on Nonassociative Structures

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

Abstract

A homomorphic encryption allows specific types of computations on ciphertext and generates an encrypted result that matches the result of operations performed on the plaintext. Some classic cryptosystems, e.g., RSA and ElGamal, allow homomorphic computation of only one operation. In 2009, C. Gentry suggested a model of a fully homomorphic algebraic system, i.e., a cryptosystem that supports both addition and multiplication operations. This cryptosystem is based on lattices. Later M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan suggested a fully homomorphic system based on integers. In a 2010 paper of A. V. Gribov, P. A. Zolotykh, and A. V. Mikhalev, a cryptosystem based on a quasigroup ring was constructed, developing an approach of S. K. Rososhek, and a homomorphic property of this system was investigated. An example of a quasigroup for which this system is homomorphic is given. Also a homomorphic property of the ElGamal cryptosystem based on a medial quasigroup is shown.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. D. Belousov, Foundation of the Theory of Quasigroups and Loops [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  2. R. Bruck, A Survey of Binary Systems, Springer, Berlin (1958).

    Book  MATH  Google Scholar 

  3. A. V. Gribov, P. A. Zolotykh, and A. V. Mikhalev, “A construction of algebraic cryptosystem over the quasigroup ring,” Mat. Vopr. Kriptogr., 4, No. 4, 23–33 (2010).

    Google Scholar 

  4. S. Y. Katyshev, V. T. Markov, and A. A. Nechaev, “Using nonassociative groupoids for realization of an open key distribution procedure,” Diskret. Mat., 26, No. 3, 45–64 (2014).

    Article  Google Scholar 

  5. S. K. Rososhek, “Group ring cryptosystems,” Vestn. Tomsk. Gis. Univ., No. 6, 57–62 (2003).

  6. M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” Advances in Cryptology—EUROCRYPT 2010, Lect. Notes Comput. Sci., Vol. 6110, Springer, Berlin (2010), pp. 24–43.

  7. T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. Inform. Theory, 31, No. 4, 469–472 (1985).

    Article  MathSciNet  MATH  Google Scholar 

  8. C. Gentry, A Fully Homomorphic Encryption Scheme, Ph.D. Thesis, Stanford Univ. (2009).

  9. J. D. H. Smith, Representation Theory of Infinite Groups and Finite Quasigroups, Univ. Montreal, Montreal (1986).

    Google Scholar 

  10. K. Toyoda, “On axioms of linear functions,” Proc. Imp. Acad. Tokyo, 17, 221–227 (1941).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    A. V. Gribov

Authors
  1. A. V. Gribov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Gribov.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 20, No. 1, pp. 135–143, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gribov, A.V. Some Homomorphic Cryptosystems Based on Nonassociative Structures. J Math Sci 223, 581–586 (2017). https://doi.org/10.1007/s10958-017-3367-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-017-3367-7

Search

Navigation