21-09-2016, 11:16 AM
1455535585-docofvoting.doc (Size: 94.5 KB / Downloads: 5)
In the era of technology, the voting machine, which is present today, is highly unsecured. Being in the age of Computers we are compromising the security by opting for Electronic voting machine because in the present electronic voting machine is not intelligent that is it cannot determine the person came for the voting is eligible or not . That mean the whole control is kept in the hand of voting in charge officer. One more risk with the present voting machine is that any body can increase the vote count, since the count is present in the machine itself.
In proposed machine that is “Global Wireless E-Voting “. In this the machine is made intelligent which can determine the eligibility of the voter by scanning the eye pattern and also the vote count is not kept into the same machine itself instead of it it is store in the remote server by converting it into radio waves. Here there is no chance of increasing the vote count of machine. Even in case of damage to voting machine there will not be harm to continuity of the election process. The overall concept of “Global Wireless E-Voting “is explained.
INTRODUCTION:
In India election has supreme weight age. So to make it secured and efficient in the vision of modern technology we are “Global Wireless E-Voting”.
Why we are looking for it?
PRESENT SYSTEM:
• Since now days voting system is replaced by electronic machine to carry out voting.
• Now in a present system each and every section is given a electronic machine which stores the votes of the people how have voted for the particular candidate.
• Control of present system is given to the in charge officer. He only check for the eligibility of the candidates and allow for the voting.
• Finally we collect all the voting machine at a place and go for counting.
DIS ADVANTAGES OF THE PRESENT SYSTEM:
• After voting if any technical problems or damage occurs with the machines it may leads to the re election.
• The machine is not able to recognize the eligibility of a candidate, so the corrupted officers may misguide the people.
• The corrupted officers may increase the count of the voting.
• During transportation of the machines the in charge person can change the status of machines and even may destroy.
• This system is not a cost effective one. Since we need security, in charge officers, secured place for counting and election place.
• The person from any other region cannot vote in for a candidate of other region.
• The voting take place where the machine is located.
PROPOSED SYSTEM:
• In our system we trying to keep counting of votes in to a remote secured system.
• In this system we are using a electronic circuit which enable the voter to vote and transfer this vote to the remote system by converting it to radio wave through the mobile towers.
• Our machine can check the eligibility of the candidate by itself, so there is no question of corruption. Machine itself is automated to check the eligibility of the candidates.
• Here we need not to go for the re election even if the machine is damaged.
• A person even can vote from a mobile system and also from Internet.
• We can vote from any where even though being a voter of another region.
1. Radio waves representing scanned retina pattern and vote to Mobile tower.
2. Radio waves representing scanned retina pattern and vote to remote server.
3. Acknowledgement (+ve or –ve) from the server to mobile tower.
4. Acknowledgement (+ve or –ve) from mobile tower to Interface device.
5. Ready signal if retina is scanned properly to voting machine. And if –ve signal then alert alarm will be activated.
6. Accepted vote is made to flow to the interface device.
7.
DETAIL DIAGRAM OF THE VOTING MACHINE:
The voting machine is actually a device which generates the different voltages for different votes these voltages are fed to the (ADC) which is then converted to digital bits then can be converted to radio waves.
The detail diagram is overleaf.
HURDLES IN THE PATH OF IMPLEMENTATION:
There are several more issues that we have to consider along the Implementation such as
Security
Efficiency
Geographical Problems
Security
The radio waves of a mobile frequency consist of Retina pattern and vote can be generated by means of external source. That’s why we need to provide some sot of security to avoid this problem. One of the idea to solve this problem is CDMA (which will be explained later ) and another technique is inserting security bits at regular interval of time during the transmission of radio waves (Ex.2 msec) .At the server side after the given interval (2 msec ) security bits are checked (ex 1001) . In case of positive confirmation we can accept as valid vote, other wise simply rejected.
Another problem is that one may trap the radio waves in between and can determine the person and the vote; this may disclose the result of the election before the completion of the voting process. To avoid this problem we can go for applying the efficient and complex encryption algorithm so that the transparency of data can be hidden and the server side the encrypted data can be again decrypted and original data can retrieved this make the trapping of wave meaningless .The encryption algorithm can be termed as Key Complex Algorithm, which is as follows,
First it finds the length of the string.
Generate the random numbers equal to the length of the string.
Add the corresponding Characters from the given string and random values.
E.g. KSHITIJ
Let this be the given words.
The length of the given string is 7. So let us generate the 7 random numbers .Let numbers be
A) 8 12 34 4 11 9 26 .The ASCII value for KSHITIJ are
K S H I T I J
B) 75 83 72 73 84 73 74
Add corresponding A) and B) values as
8+75 12+83 34+72 4+73 11+84 9+73 26+74
83 95 106 77 95 82 100
The corresponding ASCII characters for these are
S _ j M _ R d
The corresponding characters for random values
•
Finally encrypted data as
S ¬ _ j M ¬_ • R d
The final encrypted data is formed in such a way that the random data at the even place and rest at odd place. This makes Decryption very easy. Simply subtract the character at even place from odd place character.