A new elliptic curve cryptographic system over the finite fields
Security of the information is the main problem in network communications nowadays. There is no algorithm which ensures the one hundred percent reliability of the transmissions. The current society uses the Internet, to exchange information such as from private images to financial data. The cryptogr...
| Main Authors: | , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/59454 |
| _version_ | 1848760484828807168 |
|---|---|
| author | Priyatharsan, U. Rupasinghe, P. Murray, Iain |
| author_facet | Priyatharsan, U. Rupasinghe, P. Murray, Iain |
| author_sort | Priyatharsan, U. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Security of the information is the main problem in network communications nowadays. There is no algorithm which ensures the one hundred percent reliability of the transmissions. The current society uses the Internet, to exchange information such as from private images to financial data. The cryptographic systems are the mechanisms developed to protect and hide the information from intruders. However, advancing technology is also used by intruders to breach the security of the systems. Hence, every time cryptosystems developed based on complex Mathematics. Elliptic curve cryptography(ECC) is one of the technique in such kind of cryptosystems. Security of the elliptic curves lies in hardness of solving the discrete logarithms problems. In this research, a new cryptographic system is built by using the elliptic curve cryptography based on square matrices to achieve a secure communication between two parties. First, an invertible matrix is chosen arbitrarily in the the field used in the system. Then, by using the Cayley Hamilton theorem, private key matrices are generated for both parties. Next, public key vectors of the both parties are generated by using the private keys of them and arbitrary points of the given elliptic curve. Diffie Hellman protocol is used to authenticate the key exchange. ElGamal plus Menezes Qu Vanstone encryption protocols are used to encrypt the messages. MATLAB R2015a is used to implement and test the proper functioning of the built cryptosystem. |
| first_indexed | 2025-11-14T10:16:31Z |
| format | Conference Paper |
| id | curtin-20.500.11937-59454 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:16:31Z |
| publishDate | 2017 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-594542018-05-08T01:24:30Z A new elliptic curve cryptographic system over the finite fields Priyatharsan, U. Rupasinghe, P. Murray, Iain Security of the information is the main problem in network communications nowadays. There is no algorithm which ensures the one hundred percent reliability of the transmissions. The current society uses the Internet, to exchange information such as from private images to financial data. The cryptographic systems are the mechanisms developed to protect and hide the information from intruders. However, advancing technology is also used by intruders to breach the security of the systems. Hence, every time cryptosystems developed based on complex Mathematics. Elliptic curve cryptography(ECC) is one of the technique in such kind of cryptosystems. Security of the elliptic curves lies in hardness of solving the discrete logarithms problems. In this research, a new cryptographic system is built by using the elliptic curve cryptography based on square matrices to achieve a secure communication between two parties. First, an invertible matrix is chosen arbitrarily in the the field used in the system. Then, by using the Cayley Hamilton theorem, private key matrices are generated for both parties. Next, public key vectors of the both parties are generated by using the private keys of them and arbitrary points of the given elliptic curve. Diffie Hellman protocol is used to authenticate the key exchange. ElGamal plus Menezes Qu Vanstone encryption protocols are used to encrypt the messages. MATLAB R2015a is used to implement and test the proper functioning of the built cryptosystem. 2017 Conference Paper http://hdl.handle.net/20.500.11937/59454 10.1109/NCTM.2017.7872847 restricted |
| spellingShingle | Priyatharsan, U. Rupasinghe, P. Murray, Iain A new elliptic curve cryptographic system over the finite fields |
| title | A new elliptic curve cryptographic system over the finite fields |
| title_full | A new elliptic curve cryptographic system over the finite fields |
| title_fullStr | A new elliptic curve cryptographic system over the finite fields |
| title_full_unstemmed | A new elliptic curve cryptographic system over the finite fields |
| title_short | A new elliptic curve cryptographic system over the finite fields |
| title_sort | new elliptic curve cryptographic system over the finite fields |
| url | http://hdl.handle.net/20.500.11937/59454 |