ANALYSIS OF ENCRYPTED DIGITAL SIGNATURE ALGORITHMS BASED ON ELLIPTIC CURVES
Serik Kulmamedov, Gulnur Aksholak · Challenges of Science · 2018
The article discusses cryptographic algorithms based on elliptic curves over finite fields. It is shown that elliptic curves allow us to construct examples of finite abelian groups for cryptographic purposes. By evaluating the field, you can easily increase the cipher strength. A variant of the software implementation of this approach is considered. A software-implemented protocol can encrypt messages, generate a digital signature, and after transmitting the message, decrypt them on the recipient's side. The evaluation of the cryptographic strength of the described protocol was made.