Abstract
New algebraic structures differing from the existing ones in new kinds of operations over finite sets of m-dimensional vectors (m ≥ 2) with discrete components were developed to construct information authentication algorithms for the automatic control systems. The operation of vector multiplication including multiplication and summation of the coordinates of the multiplied vectors modulo simple number p was defined. Depending on the structure of module p, dimensionality m, and value of the “extension” coefficients defined in terms of the rules of multiplication of the base vectors, the vector spaces were shown to include high-order finite groups or be extended fields that can be efficiently used to construct effective algorithms of electronic digital signature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Buchmann, J., Introduction to Cryptography, Berlin: Springer, 2003.
Schneier, B., Applied Cryptography: Protocols, Algorithms, and Source Code, New York: Wiley, 1996.
Smart, N., Cryptography: An Introduction, New York: McGraw-Hill, 2002. Translated under the title Mir programmirovaniya: kriptografiya, Moscow: Tekhnosfera, 2005.
Pieprzyk, J., Hardjono, Th., and Seberry, J., Fundamentals of Computer Security, Berlin: Springer, 2003.
Menezes, A.J., Van Oorschot, P.C., and Vanstone, S.A., Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997.
Koblitz, N., A Course in Number Theory and Cryptography, Berlin: Springer, 2003.
van der Waerden, B.L., Algebra I, Berlin: Springer, 1971. Algebra II, Berlin: Springer, 1967. Translated under the title Algebra, Moscow: Nauka, 1976.
Kurosh, A.G., Kurs vysshei algebry (Course of Higher Algebra), Moscow: Nauka, 1971.
Moldovyan, N.A. and Moldovyan, D.N., Method of Generation and Authentication of Electronic Digital Signature Certifying an Electronic Document, RF Patent Application no. 2007147826 of December 25, 2007.
Schnorr, C.P., Efficient Signature Generation by Smart Cards, J. Cryptology, 1991, vol. 4, pp. 161–174.
Pointcheval, D. and Stern, J., Security Arguments for Digital Signatures and Blind Signatures, J. Cryptology, 2000, vol. 13, pp. 361–396.
Koblitz, N. and Menezes, A.J., Another Look at “Provable Security,” J. Cryptology, 2007, vol. 20, pp. 3–38.
Moldovyan, A.A. and Moldovyan, N.A., New Algorithms and Protocols for Information Authentication in Automatic Control Systems, Avtom. Telemekh., 2008, no. 7, pp. 157–169.
Moldovyan, N.A., Praktikum po kriptosistemam s otkrytym klyuchom (PracticalWork on Cryptosystems with Public Key), St. Petersburg: BKHV-Peterburg, 2007.
Int. Standard ISO/IEC 14888-3:2006(E). Information technology—Security techniques—Digital Signatures with appendix—Part 3: Discrete logarithm based mechanisms. (www.iso.org/iso/isocatalogue/cataloguetc).
Author information
Authors and Affiliations
Additional information
This work was supported by the Russian Foundation for Basic Research, project no. 08-07-00096-a.
Original Russian Text © N.A. Moldovyan, 2008, published in Avtomatika i Telemekhanika, 2008, No. 12, pp. 163–177.
Rights and permissions
About this article
Cite this article
Moldovyan, N.A. Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces. Autom Remote Control 69, 2142–2155 (2008). https://doi.org/10.1134/S0005117908120114
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117908120114