NEW METHOD AND ALGORITHM OF PERFORMANCE OF BASE OPERATIONS IN THE ELLIPTIC CURVES USED IN SYSTEMS OF CRYPTOGRAPHIC PROTECTIONOF THE INFORMATION


Cite item

Full Text

Abstract

In article the new method and algorithm of performance of base operations in elliptic curves with use of the modified system the Jacobian coordinates and advanced binary algorithm of scalar multiplication of points is considered. The offered approach with use of elliptic curves allows to provide higher speed of enciphering of the information in comparison with known approaches

References

  1. Cohen H. Effi cient elliptic curve exponentiation // Advances in Cryptology-proceeding of ICICS'97. Springer-Verlag, 1997. - P. 282-290.
  2. Chudnovsky D.V., Chudnovsky G.V. Sequences of numbers generated by addition in formal groups and new primary and factorization tests // Advances in Applied Math. №7, 1986. - P. 385-434.
  3. Червяков Н.И., Головко А.Н. Модифицированный алгоритм Монтгомери скалярного умножения точки на эллиптической кривой // Компьютерные науки и технологии. Белгород: Изд. ГиК, 2009. - C. 104-108.

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2010 Chervaykov N.I., Golovko A.N., Kondrashov A.V.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies