Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1200
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jena, D | - |
dc.contributor.author | Panigrahy, S K | - |
dc.contributor.author | Jena, S K | - |
dc.date.accessioned | 2010-03-16T04:36:00Z | - |
dc.date.available | 2010-03-16T04:36:00Z | - |
dc.date.issued | 2009-12 | - |
dc.identifier.citation | Proceedings of the 4th International Conference on Industrial and Information Systems, Dec 28-31, 2009, Peradeniya, Sri Lanka, P. 7-9 | en |
dc.identifier.isbn | 978-1-4244-4837-1/09 | - |
dc.identifier.uri | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5429899 | - |
dc.identifier.uri | http://hdl.handle.net/2080/1200 | - |
dc.description | Copyright belongs to Proceedings Publisher IEEE | en |
dc.description.abstract | Due to more overhead of asymmetric cryptosystems, traditionally, the symmetric cryptosystem is used to encrypt long messages. In case of symmetric cryptosystems, it creates the problem of key management. So to encrypt long messages, we usually, take the help of both symmetric and asymmetric cryptosystems. In this paper, we proposed an asymmetric cryptosystem for encrypting long messages, which is not only efficient but also secure. In consideration of the aspect of efficiency and computation, our proposed scheme uses elliptic curve cryptosystem. | en |
dc.format.extent | 574565 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE | en |
dc.relation.ispartofseries | IEEE Proceedings; | - |
dc.subject | ElGamal | en |
dc.subject | Elliptic Curve | en |
dc.subject | Public Key | en |
dc.subject | Diffie- Hellman | en |
dc.title | A Novel and Efficient Cryptosystem for Long Message Encryption | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
DJena_ICIIS09_2.pdf | 561.1 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.