Skip to main content
SpringerLink
Log in

Algebraic Simplification and Cryptographic Motives

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

Abstract. Algebraic simplification is considered from the general point of view. The main notion here is the so-called scheme of simplification due to the author. For a corepresented algebra, simplificators are related to the standard basis (Gröbner basis, Gröbner–Shirshov basis) of the ideal of defining relations. We introduce as a main subject for study the class of algebras that may be obtained from ordered semigroup algebras by “deformation” in some sense. This class contains free associative algebras and universal enveloping algebras of Lie algebras. Primary attention is paid to the latter algebras. Some possible applications to cryptography are given.

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. J. Apel and W. Lassner, “An extension of Buchberger’s algorithm and calculations in enveloping fields of Lie algebras,” Symbol. Comput., 6, 361–370 (1988).

    Article  MathSciNet  MATH  Google Scholar 

  2. G. M. Bergman, “The diamond Lemma for ring theory,” Adv. Math., 6, 178–218 (1978).

    Article  MathSciNet  Google Scholar 

  3. B. Buchberger and R. Loos, “Algebraic simplification,” Computing, 4, 11–43 (1982).

    Google Scholar 

  4. E. S. Golod, “Standard bases and homology,” in: Algebra Some Current Trends. Proc. of the 5th Nat. School in Algebra held in Varna, Bulgaria, Sept. 24–Oct. 4, 1986, Lect. Notes Math., Vol. 1352, Springer, Berlin (1988), pp. 88–95.

  5. B. Hurley and T. Hurley, Group Ring Cryptography, arXiv:1104.1724v1[math.GR] (2011).

  6. V. N. Latyshev, “An improved version of standard bases,” Formal Power Series and Algebraic Combinatorics. 12th Int. Conf., FPSAC00, Moscow, Russia, June 2000, Proc., Springer, Berlin (2000), pp. 496–505.

  7. M. H. Newman, “Theories with a combinatorial definition of ‘Equivalence’,” Ann. Math., 43, No. 2, 223–243 (1942).

    Article  MATH  Google Scholar 

  8. A. I. Shirshov, “On bases of the free Lie algebra,” Algebra Logika, 1, No. 1, 14–19 (1962).

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    V. N. Latyshev

Authors
  1. V. N. Latyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 19, No. 2, pp. 109–124, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Latyshev, V.N. Algebraic Simplification and Cryptographic Motives. J Math Sci 213, 201–210 (2016). https://doi.org/10.1007/s10958-016-2710-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-016-2710-8

Keywords

Search

Navigation