Using of R parameter in a Massey-Omura protocol on elliptic curves

Abstract

Modern cryptography is based both on the classical areas of arithmetic and algebra, such as modular arithmetic, finite field theory, and on the most modern sections, including the theory and applications of elliptic curves, and anti-jamming coding. However, the development of computer technology leads to an increase in the stability of cryptosystems, that is, the length of keys. In this article, a method for increasing stability using parametric algebra without increasing the key length is illustrated by the example of the Messi-Omura algorithm based on an elliptic curve.

Topics

Identifiers

DOI

10.1109/icisct52966.2021.9670125

Citations and references