A Lossless MOD-ENCODER Towards a Secure Communication
The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 332 |
|---|---|
| container_issue | |
| container_start_page | 330 |
| container_title | |
| container_volume | |
| creator | Kumar, G Praveen Parajuli, Biswas Murmu, Arjun Kumar Choudhury, Prasenjit Howlader, Jaydeep |
| description | The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language L with a finite alphabet set ¿. The encoded message is a bi-tuple of which, the first is a vector of quotients denoted as Q and the second is a representation of remainders denoted as R with respect to a modulus M. The secrecy of the message is retained by communicating R over a secure channel using some standard encryption mechanism. The computation overhead is also reduced as the encryption is done only on one half of the encoded message. Further, this encoding mechanism provides a lossless compression. |
| doi_str_mv | 10.1109/ITC.2010.89 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5460572</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5460572</ieee_id><sourcerecordid>5460572</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-64af06a36ee6b8c4eecfa8bad778b78805a9f101d8c66fec3c3eb52fc35310d03</originalsourceid><addsrcrecordid>eNotzE9LwzAYgPGICMrsyaOXfIHON_-T48iqDqoF7X2k6RsIrKs0G-K3V9TTw-_yEHLHYM0YuIdd79ccfmTdBamcsWC0U8IZxS5_zSSXUjml7TWpSskDMGUFF4LfELWh7VzKAUuhL922bl59t23eaD9_hmUsNNB3jOcFqZ-n6XzMMZzyfLwlVykcClb_XZH-sen9c912Tzu_aevs4FRrGRLoIDSiHmyUiDEFO4TRGDsYa0EFlxiw0UatE0YRBQ6KpyiUYDCCWJH7v21GxP3HkqewfO2V1KAMF9-Lt0T-</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Lossless MOD-ENCODER Towards a Secure Communication</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kumar, G Praveen ; Parajuli, Biswas ; Murmu, Arjun Kumar ; Choudhury, Prasenjit ; Howlader, Jaydeep</creator><creatorcontrib>Kumar, G Praveen ; Parajuli, Biswas ; Murmu, Arjun Kumar ; Choudhury, Prasenjit ; Howlader, Jaydeep</creatorcontrib><description>The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language L with a finite alphabet set ¿. The encoded message is a bi-tuple of which, the first is a vector of quotients denoted as Q and the second is a representation of remainders denoted as R with respect to a modulus M. The secrecy of the message is retained by communicating R over a secure channel using some standard encryption mechanism. The computation overhead is also reduced as the encryption is done only on one half of the encoded message. Further, this encoding mechanism provides a lossless compression.</description><identifier>ISBN: 9781424459568</identifier><identifier>ISBN: 1424459567</identifier><identifier>EISBN: 9780769539751</identifier><identifier>EISBN: 9781424459575</identifier><identifier>EISBN: 0769539750</identifier><identifier>EISBN: 1424459575</identifier><identifier>DOI: 10.1109/ITC.2010.89</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Bandwidth ; Cryptography ; Data communication ; Data compression ; Data security ; Encryption ; Internet ; Modulo Arithmetic ; National security ; Number Representation ; Telecommunication computing ; Telecommunication traffic</subject><ispartof>2010 International Conference on Recent Trends in Information, Telecommunication and Computing, 2010, p.330-332</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5460572$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5460572$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kumar, G Praveen</creatorcontrib><creatorcontrib>Parajuli, Biswas</creatorcontrib><creatorcontrib>Murmu, Arjun Kumar</creatorcontrib><creatorcontrib>Choudhury, Prasenjit</creatorcontrib><creatorcontrib>Howlader, Jaydeep</creatorcontrib><title>A Lossless MOD-ENCODER Towards a Secure Communication</title><title>2010 International Conference on Recent Trends in Information, Telecommunication and Computing</title><addtitle>RTITC</addtitle><description>The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language L with a finite alphabet set ¿. The encoded message is a bi-tuple of which, the first is a vector of quotients denoted as Q and the second is a representation of remainders denoted as R with respect to a modulus M. The secrecy of the message is retained by communicating R over a secure channel using some standard encryption mechanism. The computation overhead is also reduced as the encryption is done only on one half of the encoded message. Further, this encoding mechanism provides a lossless compression.</description><subject>Application software</subject><subject>Bandwidth</subject><subject>Cryptography</subject><subject>Data communication</subject><subject>Data compression</subject><subject>Data security</subject><subject>Encryption</subject><subject>Internet</subject><subject>Modulo Arithmetic</subject><subject>National security</subject><subject>Number Representation</subject><subject>Telecommunication computing</subject><subject>Telecommunication traffic</subject><isbn>9781424459568</isbn><isbn>1424459567</isbn><isbn>9780769539751</isbn><isbn>9781424459575</isbn><isbn>0769539750</isbn><isbn>1424459575</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzE9LwzAYgPGICMrsyaOXfIHON_-T48iqDqoF7X2k6RsIrKs0G-K3V9TTw-_yEHLHYM0YuIdd79ccfmTdBamcsWC0U8IZxS5_zSSXUjml7TWpSskDMGUFF4LfELWh7VzKAUuhL922bl59t23eaD9_hmUsNNB3jOcFqZ-n6XzMMZzyfLwlVykcClb_XZH-sen9c912Tzu_aevs4FRrGRLoIDSiHmyUiDEFO4TRGDsYa0EFlxiw0UatE0YRBQ6KpyiUYDCCWJH7v21GxP3HkqewfO2V1KAMF9-Lt0T-</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Kumar, G Praveen</creator><creator>Parajuli, Biswas</creator><creator>Murmu, Arjun Kumar</creator><creator>Choudhury, Prasenjit</creator><creator>Howlader, Jaydeep</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201003</creationdate><title>A Lossless MOD-ENCODER Towards a Secure Communication</title><author>Kumar, G Praveen ; Parajuli, Biswas ; Murmu, Arjun Kumar ; Choudhury, Prasenjit ; Howlader, Jaydeep</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-64af06a36ee6b8c4eecfa8bad778b78805a9f101d8c66fec3c3eb52fc35310d03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Application software</topic><topic>Bandwidth</topic><topic>Cryptography</topic><topic>Data communication</topic><topic>Data compression</topic><topic>Data security</topic><topic>Encryption</topic><topic>Internet</topic><topic>Modulo Arithmetic</topic><topic>National security</topic><topic>Number Representation</topic><topic>Telecommunication computing</topic><topic>Telecommunication traffic</topic><toplevel>online_resources</toplevel><creatorcontrib>Kumar, G Praveen</creatorcontrib><creatorcontrib>Parajuli, Biswas</creatorcontrib><creatorcontrib>Murmu, Arjun Kumar</creatorcontrib><creatorcontrib>Choudhury, Prasenjit</creatorcontrib><creatorcontrib>Howlader, Jaydeep</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kumar, G Praveen</au><au>Parajuli, Biswas</au><au>Murmu, Arjun Kumar</au><au>Choudhury, Prasenjit</au><au>Howlader, Jaydeep</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Lossless MOD-ENCODER Towards a Secure Communication</atitle><btitle>2010 International Conference on Recent Trends in Information, Telecommunication and Computing</btitle><stitle>RTITC</stitle><date>2010-03</date><risdate>2010</risdate><spage>330</spage><epage>332</epage><pages>330-332</pages><isbn>9781424459568</isbn><isbn>1424459567</isbn><eisbn>9780769539751</eisbn><eisbn>9781424459575</eisbn><eisbn>0769539750</eisbn><eisbn>1424459575</eisbn><abstract>The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language L with a finite alphabet set ¿. The encoded message is a bi-tuple of which, the first is a vector of quotients denoted as Q and the second is a representation of remainders denoted as R with respect to a modulus M. The secrecy of the message is retained by communicating R over a secure channel using some standard encryption mechanism. The computation overhead is also reduced as the encryption is done only on one half of the encoded message. Further, this encoding mechanism provides a lossless compression.</abstract><pub>IEEE</pub><doi>10.1109/ITC.2010.89</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781424459568 |
| ispartof | 2010 International Conference on Recent Trends in Information, Telecommunication and Computing, 2010, p.330-332 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5460572 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Application software Bandwidth Cryptography Data communication Data compression Data security Encryption Internet Modulo Arithmetic National security Number Representation Telecommunication computing Telecommunication traffic |
| title | A Lossless MOD-ENCODER Towards a Secure Communication |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T16%3A06%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Lossless%20MOD-ENCODER%20Towards%20a%20Secure%20Communication&rft.btitle=2010%20International%20Conference%20on%20Recent%20Trends%20in%20Information,%20Telecommunication%20and%20Computing&rft.au=Kumar,%20G%20Praveen&rft.date=2010-03&rft.spage=330&rft.epage=332&rft.pages=330-332&rft.isbn=9781424459568&rft.isbn_list=1424459567&rft_id=info:doi/10.1109/ITC.2010.89&rft_dat=%3Cieee_6IE%3E5460572%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769539751&rft.eisbn_list=9781424459575&rft.eisbn_list=0769539750&rft.eisbn_list=1424459575&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5460572&rfr_iscdi=true |