<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology-h-information-technology</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology - H: Information &amp; Technology</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/54677.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">54677</article-id>
<title-group>
<article-title>Optimal Asymmetric Data Encryption Algorithm</article-title>
<subtitle>EC Encryption: Faster than RSA but Larger Ciphertext</subtitle>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>D.M.</surname><given-names>Kuryazov</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
</contrib-group>
<aff id="aff1">UZBEKISTAN, National University of Uzbekistan, Uzbekistan</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2021-07-15">
<day>15</day>
<month>07</month>
<year>2021</year>
</pub-date>
<volume>21</volume>
<issue>H2</issue>
<fpage>43</fpage>
<lpage>47</lpage>
<abstract><p>Today, public-key cryptosystems are particularly vulnerable to fetching cipher text and adaptively matched plaintext attacks. To prevent such attacks, in practice, optimal asymmetric algorithms are used, for example, RSA-OAEP and etc. In this article, using the method of encoding messages by points of an elliptic curve, an optimal asymmetric algorithm is proposed for data encryption which is based on elliptic curves.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>asymmetric algorithms</kwd>
<kwd>elliptical curves</kwd>
<kwd>encoding and decoding</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume21/5-Optimal-Asymmetric-Data-Encryption-Algorithm.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/optimal-asymmetric-data-encryption-algorithm/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>Today, public-key cryptosystems are particularly vulnerable to fetching cipher text and adaptively matched plaintext attacks. To prevent such attacks, in practice, optimal asymmetric algorithms are used, for example, RSA-OAEP and etc. In this article, using the method of encoding messages by points of an elliptic curve, an optimal asymmetric algorithm is proposed for data encryption which is based on elliptic curves.</p>
</sec>
</body>
</article>