A Comparative Analysis of One-Time Pad and Contemporary Cryptographic Algorithms: Security, Quantum Resistance, and Practical Usability

Authors

  • Hafiz Waheed ud Din • Department of Computer and software engineering, faculty of computing Gomal University
  • Yahya khan • Department of Computer and software engineering, faculty of computing Gomal University
  • Alameen Abdalrahman Department of computer sciences, College of Computer and Information Sciences ,Jouf University ,Sakaka - Saudia Arabia

DOI:

https://doi.org/10.62019/abbdm.v4i4.267

Keywords:

Cryptography, One-Time Pad, Quantum Computing, Security, Key Management, Practical Usability

Abstract

The performance analysis in the present study examines the OTP in contrast to popular contemporary cryptographic techniques like AES, RSA and so on. Four criteria are to be examined: Their security, their protection against attacks with quantum computers, the required key management and their practical feasibility. OTP is presented as an ideal solution in terms of security theory while being critically described in terms of the application to a large-scale system including the problem of key generation, distribution, and storage. However other contemporary methods like the AES or RSA are relatively more suitable to be used in real life systems because the execution time and space complexities are more bearable. However, as the technology of quantum computers develops, these algorithms become most threatened by quantum attacks, especially through those such as Shor’s and Grover’s. The paper also explores the concept of post-quantum cryptography as a developing field for finding solutions to protect encryption from such threats backed by quantum computing. These alternatives remain still in the early stage of development but appear to have great possibilities to protect digital communications in a world in which quantum computers could crack the more conventional cryptographic protocols. The study reveals that there is a need to achieve proper proportionalities in designing cryptographic processes and the security measures offered to ensure that they are not only strong but also implementable. OTP, being a concept of perfect secrecy, however, is not feasible for use in large applications hence why there is a need to search for algorithms that offer high-security levels while at the same time operational. With the advancement of quantum computing, it is essential that the future work be directed toward the proposition of algorithms and communication paradigms that would be both effect and efficient, and, most importantly, secure from attacks utilizing capabilities of quantum computers. Hence, the findings underscore the need for designs of cryptographic protocols that support a high level of security during deployment while still being practical for future implementation as the technologies change.

Downloads

Published

2025-01-06

How to Cite

A Comparative Analysis of One-Time Pad and Contemporary Cryptographic Algorithms: Security, Quantum Resistance, and Practical Usability. (2025). The Asian Bulletin of Big Data Management , 4(4), 284-292. https://doi.org/10.62019/abbdm.v4i4.267

Similar Articles

21-30 of 143

You may also start an advanced similarity search for this article.