Data Transmission Security in BEM Chairman E-Voting Android Based Application

Data Transmission Security in BEM Chairman E-Voting AndroidBased Application 

Abstract—Voting is a process that should be do in terms of leadership. In case, voting still use conventional methods which are less effective in terms of cost, governance, and working time. The possibility of calculation errors and fraud in the calculation process can also occur. STMIK Atma Luhur still using the conventional voting method in the election of the chairman of BEM. With the development of today’s technology, we can make electronic voting system based on Android to solve the problems of conventional voting.

https://codeshoppy.com/php-projects-titles-topics.html

E-voting security becomes fundamental things that must be considered. RSA cryptographic methods can be a solution to ensure the security. 

RSA choses because it has the advantage of difficulty level in factoring numbers into prime numbers. More difficult factoring the numbers, it will be more difficult to break the encryption. Another advantage is the form of higher security than symmetric algorithm. This algorithm is also resistant to various forms of attack, such as brute force. The security testing are using Wireshark and Eclipse LogCat. The result is the establishment of an e-voting system based on Android that is safe and confidential, so the students can do the voting quickly, whenever and wherever.Keywords—E-Voting; RSA Algorithm; Cryptography; Mobile; Android 

 INTRODUCTION 

Voting is making decision process in terms of leadership. STMIK Atma Luhur today still using conventional election methods that less effective in terms of cost, governance, time, and security. Conventional election method make possible the calculation error and fraud in the calculation process. Today, technology has been growing rapidly, and Android phone usage is also increasing. With these condition, it can be proposed election of BEM chairman using Android mobile phone. There are many benefit of using mobile e-voting like computerized voting counting process so that becomes faster, more precise, and more accurate. The cost of implementing voting can also be reduced. Users are also able to vote anywhere and anytime with their own Android phone. The possibility of fraud and error calculation can also be avoided. Security of e-voting become the fundamental things that must be considered. There are four things that must be considered, namely accurate, democracy, privacy, andverifiability [1]. To fulfill these security aspect, cryptographic methods are needed to keep safe the security of that information. There are several methods of cryptography, one of which is RSA (Rivest-Shamir Adleman). This algorithm is an asymmetric cryptographic algorithms that perform with different encryption and decryption keys. 

This algorithm chosen because it has the form of a higher security than symmetric algorithms. In addition, this method is used for applications requiring fast digital data [2]. This algorithm is also resistant to various forms of attack, especially brute force. Other advantages are the degree of difficulty in factoring numbers into primes [3]. The purpose of this study is to make mobile e-voting system based on Android with RSA algorithm method in data transmission security. II.RELATED WORKResearch by Al-Anie [4] conducted a study that the implementation of e-voting security protocol based on public key cryptosystem encryption. Nawindah [5], his work resulted the implementation of e-voting with MD5 encryption and election results were immediately visible. 

Handoyo [6] conducted a study that resulted the design of e-voting system with a cryptographic hash function without encryption and decryption. Kerem [7] resulted the use of NFC in mobile voting. Stradiotto [8] conducted the election process through the SMS protocol using web 2.0 tools and prototype system that can send voters data to the web service. Wisnu [9] resulted election-app with Hash Algorithm-1 and RSA key pair digital signing security method. Adnan [10] resulted multicore utilization for application of local e-voting purpose.  

RIVEST SHAMIR ADLEMAN (RSA)

The RSA algorithm consist from four steps : key generation, key distribution, encrytion, and decription. RSA have basic principle which are find three very large positive integers e,d, and n with modular exponentiation (m). 

A.Key Generation The RSA algorithm using a public key (e,n) to encrypt the plaintext message.To decrypt the ciphertext, RSA using private key (d,n). The following are formula to compute C which is ciphertextand M which is plaintext. 

B.Key Distribution To distribute public and private key, User A transmit the public key (n, e) to User B via general way, but not the private key. The private key is never distributed. 

C.Encryption To calculate C (ciphertext), we can use formula (1) as shown as below : C = Me mod n(1) α + β = χ. (1) (1) •C is calculation result into ciphertext (encrypted number). •M represent the plaintext that has been converted into ASCII code. •The value of e and n is a public key pair that has been generated through the key generation process. Here are the following RSA encryption flowchart shown as figure 1 : Fig. 1: RSA encryption Flowchart 

D.Decryption To calculate M (plaintext), we can use formula (2) as shown as below : M = Cdmod n (2) •M is calculation result the value that to be returned into plaintext. •C represent of the ciphertext or encrypted message that will be converted into plaintext. •The value of d and n are pairs of private key that have been generated through the key generation process.