Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Mat. Vopr. Kriptogr., 2013, Volume 4, Issue 2, Pages 47–57 (Mi mvk82)  

This article is cited in 1 scientific paper (total in 1 paper)

Efficient implementation of the GOST R 34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication

D. M. Dygin, S. V. Grebnev

Russian Technical Committee for Standardization (TC 26), Moscow

Abstract: An approach to an efficient implementation of the Russian national digital signature scheme GOST R 34.10 in view of its new extensions is proposed. Modern algorithms for scalar multiplication and different representations of elliptic curves over prime finite fields are used. Results of numerical experiments and recommendations on the selection of parameters of algorithms are presented.

Key words: digital signature, GOST R 34.10, Edwards curves, Hessian curves, scalar multiplication, national standard, efficient implementation, performance evaluation.

DOI: https://doi.org/10.4213/mvk82

Full text: PDF file (110 kB)
References: PDF file   HTML file

UDC: 519.719.2+519.742.72
Received 18.IX.2012
Language:

Citation: D. M. Dygin, S. V. Grebnev, “Efficient implementation of the GOST R 34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication”, Mat. Vopr. Kriptogr., 4:2 (2013), 47–57

Citation in format AMSBIB
\Bibitem{DygGre13}
\by D.~M.~Dygin, S.~V.~Grebnev
\paper Efficient implementation of the GOST~R~34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication
\jour Mat. Vopr. Kriptogr.
\yr 2013
\vol 4
\issue 2
\pages 47--57
\mathnet{http://mi.mathnet.ru/mvk82}
\crossref{https://doi.org/10.4213/mvk82}


Linking options:
  • http://mi.mathnet.ru/eng/mvk82
  • https://doi.org/10.4213/mvk82
  • http://mi.mathnet.ru/eng/mvk/v4/i2/p47

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. S. V. Grebnev, “Optimizing memory cost of multi-scalar multiplication”, Matem. vopr. kriptogr., 7:2 (2016), 53–60  mathnet  crossref  mathscinet  elib
  • Математические вопросы криптографии
    Number of views:
    This page:699
    Full text:309
    References:53

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021