Optimal Asymmetric Data Encryption Algorithm

Kuryazov D.M.

Optimal Asymmetric Data Encryption Algorithm

Kuryazov D.M. * §

Contact

§ National University of Uzbekistan, Uzbekistan

Optimal Asymmetric Data Encryption Algorithm

Article Fingerprint

ReserarchID

CSTRTPL0

Optimal Asymmetric Data Encryption Algorithm Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant

This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

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.

References

20 Cites in Article

Reference Format

O'zdst (2014). Hybrid Cryptographic Protocols Providing Digital Signature.
O'zdst (1092). State standard of the Republic of Uzbekistan. Information technology. Cryptographic information protection. Processes of formation and verification of electronic digital signature.
M Aripov,D Kuryazov (2012). On one EDS algorithm with a composite module // Reports of the Academy of Sciences of the Republic of Uzbekistan.
D Kuryazov (2013). EDS algorithm on elliptic curves.
Davlatov Mirzo- Ulugbek,Allanov Orif,Turdibekov Baxtiyor (2012). Application Of Neural Networks In Cryptanalysis: The Case Of The Vigenère Algorithm.
D Kuryazov (2012). Modifications of the EDS algorithm GOST R34.10-94 and their cryptanalysis.
Mamatov Narzillo,Samijonov Abdurashid,Nurimov Parakhat,Niyozmatova Nilufar (2013). Karakalpak Speech Recognition with CMU Sphinx.
M Aripov,D Kuryazov (2018). Algorithm of without key hash–function based on Sponge-scheme.
I Gorbenko,D Balagura (2002). Directional encryption schemes in groups of points on an elliptic curve.
Nikolay Moldovyan,Andrey Berezin,Anatoly Kornienko,Alexander Moldovyan (2013). Deniable encryption protocols based on probabilistic public-key encryption.
A Bolotov,S Gashkov,Others Algorithmic foundations of elliptic cryptography.
V Miller Use of elliptic curves in cryptography // Advances in cryptology-CRYPTO.
Calif Barbara (1985). Sino-Soviet Conflict: A Historical Bibliography. (Santa Barbara, Calif.: ABC-Clio Information Services, 1984. Pp. 204. $28.50.).
Neal Koblitz (1988). From Congruent Numbers to Elliptic Curves.
Mihir Bellare,Phillip Rogaway (1995). Optimal asymmetric encryption.
Wenbo Mao (2005). Classical Cryptography.
B Abdurakhimov,A Sattarov (2018). An algorithm for constructing S-boxes for block symmetric encryption.
A Sattarov (2018). About the algorithm of data encryption BTS.
B Abdurakhimov,A Sattarov (2019). Algebraic immunity of Boolean function // Computational technologies.
D Kuryazov (2020). Algorithm for ensuring message confidentiality using elliptic curves.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Kuryazov D.M.. 2021. "Optimal Asymmetric Data Encryption Algorithm". Global Journal of Computer Science and Technology - H: Information & Technology GJCST-H Volume 21 (GJCST Volume 21 Issue H2).

More Citation Formats

Select Citation Style:

Download Citation

GJCST Volume 21 Issue H2

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-H Classification E.3

Submission ReceivedJune 12, 2021
Peer Review Double Blind
Handling Editor
Accepted July 4, 2021
Published July 15, 2021

Version of record

v1.2

Issue date

April 19, 2021

Language

English

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Views: 1.1K

Total Downloads: 93

All Trends