Open Access iconOpen Access



Security Protocol Function Using Quantum Elliptic Curve Cryptography Algorithm

K. Sudharson1,*, S. Arun2

1 Department of Information and Communication Engineering, Anna University, Chennai, 600025, India.
2 Department of ECE, Prathyusha Engineering College, Thiruvallur, 602025, India.

* Corresponding Author: K. Sudharson. Email: email

Intelligent Automation & Soft Computing 2022, 34(3), 1769-1784.


Quantum Computing (QC). The content of node or sink nodes is processed using the fundamental principles of quantum mechanics. However, cryptography techniques face several other issues, such as availability, integrity, and vulnerability, to name a few. The researchers have overcome many obstacles, yet security remains a crucial concern in QC. However, experimenters recently discovered that the QC has a lot more data hacking than static networks. Moreover, the bitwise error is still present in implementing the Quantum Computing Cryptography Protocol (QCCP). Because all nodes are mobile and dynamic topology occurs, the proposed research uses the Quantum Elliptical Curve Cryptography (QECC) protocol. To provide the appropriate key generation and key sharing mechanism to convert the fool node to a brawny node and avoid packet loss and energy consumption in the network. By turning the fool node into a vital node, the QECC lowers the network's error rate. The experiment uses Network Simulator 2 to achieve successful outcomes such as decreased packet loss, reduced error rate with increased energy consumption, increased pair key generation for additional nodes, and increased packet size.


Cite This Article

K. Sudharson and S. Arun, "Security protocol function using quantum elliptic curve cryptography algorithm," Intelligent Automation & Soft Computing, vol. 34, no.3, pp. 1769–1784, 2022.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1052


  • 590


  • 0


Share Link