Voter Authentication Using Modified Elliptic Curve Cryptography

  • K. SujathaEmail author
  • A. Arjuna Rao
  • Prathyusha Yejarla
  • K. J. Sruthi
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 77)


Voter authentication in general election is a very expensive and time-consuming issue. At present, identifying the voter is done through their voter ID cards in the presence of local people and this process leads to malpractice and rigging. Some security algorithms are available in similar areas where identification is required. However, they are found to be failed in many situations. When compared to the existing system, proposed system will give better results by reducing security issues. This introduces concept of voter authentication using modified elliptic curve cryptography where the voter can be authentication over Internet by using public communication channel. Then he can cast his vote through Internet. Elliptic curve cryptography is a public key cryptographic algorithm where it uses couple of keys as private and public. Private key is used by the voter and public key is used to authenticate the voter. The private key in ECC is chosen by using cuckoo search optimization technique instead of randomly choosing the values. The proposed methodology is enhanced using live sample database and is found to be secured by all means.


Voter authentication General election Security algorithms Modified elliptic curve cryptography (MECC) Public key cryptographic algorithms Private key Cuckoo search algorithm 



The authors thank Ms. Madhavi V Lokam for the entire support and facilities provided to us during carrying out this work.


  1. 1.
    Sujatha, K., Nageswara Rao, P.V., Arjuna Rao, A., Rajesh, L.V., Vivek Raja, V.: Secured internet voting system based on combined DSA and multiple DES algorithms. In: ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol II Advances in Intelligent Systems and Computing, vol. 249, pp. 643–650 (2014)Google Scholar
  2. 2.
    Barthelemy, P., Bertolotti, J., Wiersma, D.S.: A L’evy flight for light. Nature 453, 495–498 (2008)CrossRefGoogle Scholar
  3. 3.
    Yang, X.-S.: Cuckoo Search via Lévy Flights. Department of Engineering, University of Cambridge, Trumpinton Street, Cambridge CB2 1PZ, UKGoogle Scholar
  4. 4.
    Amara, M., Siad, A.: Elliptic curve cryptography and its applications. In: 2011 7th International Workshop on Systems, Signal Processing and their Applications (WOSSPA), pp. 247–250 (2011)Google Scholar
  5. 5.
    Qing, Z., Zhihua, H.: The large prime numbers generation of RSA algorithm based on genetic algorithm. In: 2011 International Conference on Intelligence Science and Information Engineering (ISIE), pp. 434–437 (2011)Google Scholar
  6. 6.
    Wang, M., Dai, G., Hu, H., Pen, L.: Selection of security elliptic curve based on evolution algorithm. In: CINC ’09. International Conference on Computational Intelligence and Natural Computing, vol. 1, pp. 55–57 (2009)Google Scholar
  7. 7.
    Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48,  203–209 (1987)Google Scholar
  8. 8.
    Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in cryptology-CRYPT0 ’85, LNCS 218, pp. 417–426 (1986). IEEE International Conference, vol. 1, pp. 681–685. IEEE (2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • K. Sujatha
    • 1
    Email author
  • A. Arjuna Rao
    • 2
  • Prathyusha Yejarla
    • 2
  • K. J. Sruthi
    • 2
  1. 1.Nadimpalli Satyanarayana Raju Institute of TechnologyVisakhapatnamIndia
  2. 2.Miracle Educational Society Group of InstitutionsVizianagramIndia

Personalised recommendations