Show simple item record

dc.contributor.author Iroshan, AKA
dc.contributor.author Indrajee, KHH
dc.contributor.author Mahawithana, P
dc.contributor.author Dharshana, KUGS
dc.contributor.author Premarathna, PHSR
dc.contributor.editor De Silva, R
dc.date.accessioned 2022-12-14T09:22:07Z
dc.date.available 2022-12-14T09:22:07Z
dc.date.issued 2012
dc.identifier.citation ****** en_US
dc.identifier.uri http://dl.lib.uom.lk/handle/123/19794
dc.description.abstract Cryptography is a concept and a methodology for secret communication, which is used and improved thousands of years. Cryptography includes a vast variety of implementation schemes, starting from simple shifting ciphers to DNA algorithms. In this paper we discuss extensively the algorithms behind those cryptographic schemes and the computability aspects of such algorithms. We outline the advantageous factors in computational complexity in such schemes. Also some interesting research being done on this area and problem areas where further research is needed, are outlined. en_US
dc.language.iso en en_US
dc.publisher Department of Computer Science and Engineering, University of Moratuwa. en_US
dc.subject Computability en_US
dc.subject Cryptography en_US
dc.subject Encryption en_US
dc.title Computability in cryptography en_US
dc.type Conference-Full-text en_US
dc.identifier.faculty Engineering en_US
dc.identifier.department Department of Computer Science and Engineering en_US
dc.identifier.year 2012 en_US
dc.identifier.conference CSE Symposium 2014 en_US
dc.identifier.place Katubedda en_US
dc.identifier.pgnos pp. 39-46 en_US
dc.identifier.proceeding Proceedings of the CSE Symposium 2014 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record