EEPIS Repository

Kompresi Dan Enkripsi SMS Menggunakan Metode Huffman Code Dan Algoritma Enigma

Amrullah , Ata and Nadlori , Isbat Uzzin and Hakkun , Rizky Yuniar (2010) Kompresi Dan Enkripsi SMS Menggunakan Metode Huffman Code Dan Algoritma Enigma. EEPIS Final Project.

[img]
Preview
PDF - Published Version
Download (540Kb) | Preview

    Abstract

    Implementation of compression method in sending text message via sms could reduce charge of money. Two up to three of text message could be cut up. So it cost one sms only.. To extend the usage of compression method it will be combined with encryption method as security of sms. The method that will be used are huffman algorithm and Enigma algorithm. To deliver this message we use sms as service. Of course we need to decompress the received message and we make a program to do it. We provide a program to compress-decompress text message and also encrypt-decrypt text message. We expect the cost of system could be decrease. Keyword : sms, compression , huffman code, enigma, encryption.

    Item Type: Article
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Q Science > QA Mathematics > QA76 Computer software
    Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
    Depositing User: Mrs Ashri Esy
    Date Deposited: 29 Jul 2011 14:58
    Last Modified: 29 Jul 2011 14:58
    URI: http://repo.eepis-its.edu/id/eprint/730

    Actions (login required)

    View Item