Advertisement

Vector Finite Groups as Primitives for Fast Digital Signature Algorithms

  • Nikolay MoldovyanEmail author
  • Andrey Moldovyan
Conference paper
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

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.

Keywords

Digital signature Vector finite groups Multidimension cyclicity Vector finite fields Elliptic curves 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pieprzyk J, Hardjono Th, and Seberry J (2003) Fundamentals of Computer Security. Springer-Verlag. BerlinGoogle Scholar
  2. 2.
    Menezes AJ, Van Oorschot PC, and Vanstone SA (1997) Handbook of Applied Cryptography. CRC Press, Boca Raton, FLGoogle Scholar
  3. 3.
    Schnorr CP (1991) Efficient signature generation by smart cards. J Cryptology 4: 161–174CrossRefGoogle Scholar
  4. 4.
    . National Institute of Standards and Technology, NIST FIPS PUB 186. Digital Signature Standard, U.S. Department of Commerce (1994)Google Scholar
  5. 5.
    . 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)Google Scholar
  6. 6.
    Koblitz N (1987) Elliptic curve cryptosystems. J Mathematics of Computation. 48: 203–209CrossRefGoogle Scholar
  7. 7.
    Miller V (1986) Use of elliptic curves in cryptography. Advances in cryptology: Proceedings of Crypto'85. LNCS, vol. 218, pp. 417–426. Springer, HeidelbergGoogle Scholar
  8. 8.
    Buchmann J (2003) Introduction to Cryptography. Springer-Verlag, BerlinGoogle Scholar
  9. 9.
    . ANSI X9.62 and FIPS 186-2. Elliptic curve signature algorithm (1998)Google Scholar
  10. 10.
    . 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).Google Scholar
  11. 11.
    . Moldovyan NA, Moldovyanu PA (2008) New Primitives for Digital Signature Algorithms: Vector Finite Fields. J Computer Science Journal of MoldovaGoogle Scholar
  12. 12.
    Menezes AJ and Vanstone SA (1993) Elliptic Curve Cryptosystems and Their Implementation. J Journal of cryptology 6: 209–224Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Specialized Center of Program System “SPECTR”PetersburgRussia

Personalised recommendations