Abstract
Using digital signature (DS) algorithms to perform electronic messages authentication is an issue of significant importance for geographical information systems. The most computationally efficient DS algorithms are based on elliptic curves (EC) over finite fields. However, for many practical applications more efficient DS algorithms are required. To satisfy such performance requirements a new type of the finite groups is proposed as primitive for DS schemes. The elements of the proposed groups are vectors defined over the ground finite field. The group operation is the vector multiplication defined with some basis vector multiplication tables the characteristic feature of which is the use of expansion coefficients. It has been shown that the vector groups possess the multidimensionyclic structure and in special cases the dimension of the cyclicity is μ = 1. In such special cases the vector finite fields (VFFs) are formed. The DS algorithms based on EC over VFFs provides performance significantly higher than the performance of the known EC-based algorithms. Fast DS algorithms based on computations in vector finite groups corresponding to the case μ ≥ 2have also been proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pieprzyk J, Hardjono Th, and Seberry J (2003) Fundamentals of Computer Security. Springer-Verlag. Berlin
Menezes AJ, Van Oorschot PC, and Vanstone SA (1997) Handbook of Applied Cryptography. CRC Press, Boca Raton, FL
Schnorr CP (1991) Efficient signature generation by smart cards. J Cryptology 4: 161–174
. National Institute of Standards and Technology, NIST FIPS PUB 186. Digital Signature Standard, U.S. Department of Commerce (1994)
. GOST R 34.10-94 (1994) Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature based on Asymmetric Cryptographic Algorithm. Government Committee of the Russia for Standards (in Russian)
Koblitz N (1987) Elliptic curve cryptosystems. J Mathematics of Computation. 48: 203–209
Miller V (1986) Use of elliptic curves in cryptography. Advances in cryptology: Proceedings of Crypto'85. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg
Buchmann J (2003) Introduction to Cryptography. Springer-Verlag, Berlin
. ANSI X9.62 and FIPS 186-2. Elliptic curve signature algorithm (1998)
. GOST R 34.10-2001 (2001) Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature. Government Committee of the Russia for Standards (in Russian).
. Moldovyan NA, Moldovyanu PA (2008) New Primitives for Digital Signature Algorithms: Vector Finite Fields. J Computer Science Journal of Moldova
Menezes AJ and Vanstone SA (1993) Elliptic Curve Cryptosystems and Their Implementation. J Journal of cryptology 6: 209–224
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moldovyan, N., Moldovyan, A. (2009). Vector Finite Groups as Primitives for Fast Digital Signature Algorithms. In: Popovich, V.V., Claramunt, C., Schrenk, M., Korolenko, K.V. (eds) Information Fusion and Geographic Information Systems. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00304-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-00304-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00303-5
Online ISBN: 978-3-642-00304-2
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)