Global Wireless E-Voting Documentation

CHAPTER-1
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”.
1.1 Why we are looking for it?
• 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.
1.2 Disadvantages 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.
CHAPTER-2
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 an voter of another region .
2

CHAPTER-3
BLOCK DIAGRAM
5
5
6 Vote flow channel
Mobile tower
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.
3
Voting
machine Retina
scanne
r
Interface
Device
Ready signal
Server or
Distributed LAN
+ Interface
device
1
4
2
3
Alert
alarm

6. Accepted vote is made to flow to the interface device.
3.1 Detail Diagram of voting machine
The voting machine is actually a device which generate 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.
4

Final Out put
Antenna
5
Mixer
Retina
scanner
Security
bits gen.
Comp.
Terminal
Interface
device
Radio
Wave
Gen
CHAPTER-4
BLOCK DIAGRAM OF CLIENT SIDE CIRCUIT

CHAPTER-5
EYE RETINA SCANNING
The eye retina machine be a simple web cam or device which can capture the
images effectively .the captured image will be represented in the form of a matrix where
each pixel represents 24-bit (RGB, 8+8+8 format) let us see and understand
Here for e.g.:
here the matrix pattern of this type of picture may be as
R G B R G B R G B
[12 a1 15] [11 21 54] [25 f4 5c]
[ 2d 1c 5A] [ 99 85 57] [2c fa b3]
[1b b1 a2] [11 b1 ac] [50 b4 5F]
[CA 1f 3c] [11 2c d4] [03 ca e5]
6

5.1 INTERFACE DEVICE
This is an electronic kit which converts the input digital signals such as (retina
pattern votes+ secure bits) to radio waves.
CHAPTER-6
WORKING OF WHOLE SYSTEM
Whenever voters enter to voting booth then he will be instructed to directly look
at retina scanning machine at this time the machine scans the retina. once retina scanning
properly confirmed then it sent signal to the voting machine as to accept the vote it will
be powered on .then voter is made to vote. Now the whole data including the retina
pattern is sent to interfacing device which convert into radio waves of mobile frequency
range and these radio waves are sent to mobile tower and then to the remote server, where
the authentication and voters identification is stored into a secured database. The received
data is first converted into digital format from the radio waves through the interface
device kept at the server side, and then retina pattern and vote separated . Next the retina
pattern is matched against the existing database .If match is found then flag is check
which indicates its voting status i.e if the voter is not voted yet then +ve ack is send to the
mobile tower and then to the corresponding voting machine. This ack is recognized by
the receiver kept at the voter side and machine is made to scan next retina pattern and
vote , otherwise if –ve ack then alert alarm is made to ring .
6.1 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
7

CHAPTER-7
ECURITY
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.
Eg. KSHITIJ
Let this be the given words.
8

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 character 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.
9

CHAPTER-8
EFFICIENCY
Whenever the data which is sent from the voter (client) side, it is in the large amount,
this delays a bit a voting system and the data that is received at server side is in the
multiple access mode i.e more than one client is sending the data . To over come this
problem the following
1. Applying compression Algorithms at the Client and server side so that to decrease
the data transfer. Compression technique such as JPEG compression or any other
Compression.
2. Instead of using single server PC we will go for distributed Operating system
environment with multiple servers. This makes the job sharing and processing
faster which leads to fast responds in case of Multiple Access Environment
3. To solve the concurrency problem in case of Multiple access environment we will
use CDMA technique which is as follow
10
Key 1
data 1
Key 2
data 2
Key 4
data 4
Key 3
data 3
k1*d1+
k2*d2 +
k3*d3+
k4*d4

Here the key values are orthogonal to each other i.e k1*k2=0 and k1*k1=1 i.e if
any tries to decode the information with any other key the data will be vanished as the
data will be in the form d1*k1.
If you try to decode with K2 then effect will be as d1*k1*k2=0. this will vanish
the data .And if correct decoding key i.e k1 is used then decoding will be d1*k1*k1=d1.
this decodes the data correctly. As per the controlling concurrency for multiple access the
data from all the nodes is accepted as k1*d1+k2*d2 +k3*d3+k4*d4.In this case if you
want the data corresponding to the second node then simply multiply the whole equation
with the k2. This will give d2 as
(k1*d1+k2*d2 +k3*d3+k4*d4)*k2=d2 . So by this we can show that any numbers of
nodes are allowed to send the data, the server will accept all the data and which ever has
to be extracted will be just multiplied with corresponding key. This gets the
corresponding data. Hence the concept of Multiple access.
11

CHAPTER-9
GEOGRAPHICAL PROBLEMS
This is the problem regarding the area where technical facilities like mobile tower or
Internet service is not present. In this case will convert the vote and retina pattern into the
electrical information and pass it through the electrical conductors until we can reach the
area where the technical facilities like internet or mobile tower is available, and if only
internet facility is available is then we can convert this electrical information to digital
means and with these data using computers connected to internet we can pass the vote
and retina pattern. Here the eye scanner will be web cam.
Future Enhancements
This project can be enhanced to work over the mobiles that is voting is made
possible through the mobile through SMS.
This machine can be made vote through the INTERNET.
12

CHAPTER-10
CONCLUSION
• Thus this machine can be used for any level voting purpose. The machine
provides high level of security, authentication, reliability, and corruption -free
mechanism.
• By this we can get result with in minute after a completion of voting.. Minimum
manpower Utilization, hence mechanism is error free.
13

CHAPTER-11
REFERENCES
• Electronic circuit by Boylestead.
• Digital Integrated Electronics by Herbert Taub and Donald Schilling.
• Adini, Y., Moses, Y., and Ullman, S. (1997) Face recognition: the problem of
compensating for changes in illumination direction. Trans. Pat. Anal. Mach. Intell.
19(7): 721-732.
• Belhumeur, P.N., Hespanha, J.P., and Kriegman, D.J. (1997) Eigenfaces vs.
Fisherfaces: Recognition using class-speci_c linear projection. Trans. Pat. Anal.
Mach. Intell. 19(7): 711-720.
• Berggren, L. (1985) Iridology: A critical review. Acta Ophthalmologica 63(1): 1-8.
• Daugman, J. (1988) Complete discrete 2D Gabor transforms by neural networks for
image analysis and compression. Trans. Acous. Sp. Sig. Proc. 36(7): 1169-1179.
• Phillips, P.J., Martin, A., Wilson, C.L., and Przybocki, M. (2000) An introduction to
evaluating biometric systems. Computer 33(2): 56-63.
• Simon, A., Worthen, D.M., and Mitas, J.A. (1979) An evaluation of iridology.
Journal of the American Medical Association 242: 1385-1387.
• Viveros, R., Balasubramanian, K., and Balakrishnan, N. (1984) Binomial and
negative binomial analogues under correlated Bernoulli trials.
14

Global Wireless E-Voting Documentation

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Global Wireless E-Voting Documentation (20)

Recently uploaded (20)

Global Wireless E-Voting Documentation