Building an Elliptic Curve Cryptography to Encode and Decode Vietnamese Texts
Main Article Content
This article presents building an Elliptic curve cryptography and using it to encode and decode Vietnamese text. Here we have illustrated the prime number p = 151 in the future, which will use a large prime number. We consider an elliptic curve with a total score of 172 points. Encode and decode with standard Vietnamese text and combine with the special characters in ASCII code. The program is designed and installed and on the C# environment to give the correct result of the encryption algorithm.
Data sequence, Decryption, Discrete logarithm, Elliptic curve, Elliptic curve cryptosystem, Encryption, Public key
 Koblitz, “Elliptic curve cryptosystems”, Mathematics of Computation”, 203 - 209, 1987.
 Miller, “Uses of elliptic curves in cryptography, Advances in Cryptology - Crypto”, Lecture Notes in Computer Science, SpringerVerlag, 1986, pp. 417-426.
 Sugantha Priya, Dr.M. Mohanraj, “A Review on Secure Elliptic Curve Cryptography (ECC) and Dynamic Secure Routing Link Path Detection Algorithm (DSRLP) Under Jamming Attack”, ISSN 68(30) (2020) 0474-9030.
 Negin Dinarvand, Hamid Barati, “An efficient and secure RFID authentication protocol using ellipticcurvecryptography”,SpringerfScience+Business Media, LLC, 2017
 Utku Gulen, Selcuk Baktir, “Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform”, journal-sensors, Published: 9 March, 2020.
 Sravana Kumar, C.H. Suneetha, A.R. Chandrasekh, “Encryption of Data Using Elliptic Curve Over Finite Fields”, International Journal of Distributed and Parallel Systems (IJDPS). 3(1) (2012) 301-308.
 Amounas, E.H. El Kinani, ECC Encryption and Decryption with a Data Sequence, Applied Mathematical Sciences 6(101) (2012) 5039-5047.
 Vu Thi Hai Ha, Dinh Thi Hang, Bui Dang Binh, “The influence of volume on the formant of vowels and the identification of Vietnamese speakers”, Vietnam Institute of Linguistics, 2015.
 Enge, “Elliptic curves and their applications to cryptography”, Norwell, MA: Kulwer Academic publishers, 1999.
 Neil Koblitz, “An Elliptic Curve implementation of the finite field digital signature algorithm”, in Advances in cryptology,(CRYPTO 1998), SpringerLecture Notes in computer science, 1462 (1998) 327-337.
 S. Sandeep, Kumar, “Elliptic curve cryptography for constrained devices”, PhD thesis, Ruhr-University Bochum, June, 2006.