Please use this identifier to cite or link to this item: https://rda.sliit.lk/handle/123456789/937
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMurray, I.-
dc.contributor.authorRupasinghe, P.L.-
dc.contributor.authorPriyatharsan, U.-
dc.date.accessioned2022-02-03T06:05:37Z-
dc.date.available2022-02-03T06:05:37Z-
dc.date.issued2017-01-26-
dc.identifier.issn1800-3591-
dc.identifier.urihttp://rda.sliit.lk/handle/123456789/937-
dc.description.abstractSecurity 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.en_US
dc.language.isoenen_US
dc.publisherFaculty of Graduate Studies and Researchen_US
dc.relation.ispartofseriesVol.6;-
dc.subjectElliptic curve cryptographyen_US
dc.subjectDiscrete Logarithms Problemsen_US
dc.subjectCyber Securityen_US
dc.titleA new elliptic curve cryptographic system over the finite fieldsen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/NCTM.2017.7872847en_US
Appears in Collections:Proceedings of the 6th National Conference on Technology & Management - NCTM 2017
Research Papers - Dept of Computer Systems Engineering
Research Papers - IEEE
Research Papers - IEEE

Files in This Item:
File Description SizeFormat 
07872847.pdf
  Until 2050-12-31
254.45 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.