Skip to main content
Log in

Information authentication in automated control systems based on finite groups with multidimensional cyclicity

  • Automatic Control Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The paper deals with information authentication for real time automatic control systems. Our approach differs from known ones in using finite groups of vectors over a finite field. We show that these groups of vectors are multidimensionally cyclic. This allows developing secure digital signature algorithms based on groups with the maximal prime factor of length 160/m bits where m is the vectors’ dimension. We list formulas describing this multidimensional cyclicity of vector groups.

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. Moldovyan, N.A., Algorithms of Information Authentication for the Automatic Control Systems on the Basis of Structures in Finite Vector Spaces, Autom. Remote Control, 2008, vol. 69, no. 12, pp. 2142–2155.

    Article  MATH  MathSciNet  Google Scholar 

  2. Moldovyan, N.A. and Moldovyan, D.N., Method of Generation and Authentication of Electronic Digital Signature Certifying an Electronic Document, RF Patent Application, 2007, no. 2007147826.

  3. Kurosh, A.G., Teoriya grupp (The Theory of Groups), Moscow: Nauka, 1967.

    MATH  Google Scholar 

  4. Kargapolov, M.I. and Merzlyakov, Ju.I., Fundamentals of the Theory of Groups, New York: Springer-Verlag, 1979.

    MATH  Google Scholar 

  5. Adleman, L.M. and Demmarais, J., A Subexponential Algorithm for Finding Discrete Logarithms over All Finite Fields, Math. Comput., 1993, vol. 61, pp. 1–15.

    Article  MATH  Google Scholar 

  6. Menezes, A.J., Van Oorschot, P.C., and Vanstone, S.A., Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997.

    MATH  Google Scholar 

  7. Pieprzyk, J., Hardjono, Th., and Seberry, J., Fundamentals of Computer Security, New York: Springer, 2003.

    MATH  Google Scholar 

  8. Moldovyan, N.A., Vychislenie kornei po prostomu modulyu kak kriptograficheskii primitiv (Root Extraction Modulo Primes as a Cryptographic Primitive), Vest. S.-Peterburg. Gos. Univ., 2008, issus 1, pp. 101–106.

  9. Moldovyan, N.A., Digital Signature Scheme Based on a New Hard Problem, Comput. Sci. J. Moldova, 2008, vol. 16, no. 2(47), pp. 163–182.

    MATH  MathSciNet  Google Scholar 

  10. Schnorr, C.P., Efficient Signature Generation by Smart Cards, J. Cryptology, 1991, vol. 4, pp. 161–174.

    Article  MATH  MathSciNet  Google Scholar 

  11. Menezes, A.J. and Vanstone, S.A., Elliptic Curve Cryptosystems and Their Implementation, J. Cryptology, 1993, vol. 6, no. 4, pp. 209–224.

    Article  MATH  MathSciNet  Google Scholar 

  12. Bolotov, A.A., Gashkov, S.B., Frolov, A.B., and Chasovskih, A.A., Elementarnoe vvedenie v ellipticheskuyu kriptografiyu. Algebraicheskie i algoritmicheskie osnovy (An Elementary Introduction to Elliptic Curve Cryptography. Algebraic and Algorithmic Fundamentals), Moscow: KomKniga, 2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © N.A. Moldovyan, 2009, published in Avtomatika i Telemekhanika, 2009, No. 8, pp. 177–190.

This work was supported by the Russian Foundation for Basic Research, project no. 08-07-00096-a.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moldovyan, N.A. Information authentication in automated control systems based on finite groups with multidimensional cyclicity. Autom Remote Control 70, 1425–1436 (2009). https://doi.org/10.1134/S0005117909080141

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117909080141

PACS numbers

Navigation