One-Time Pad Cipher Using Prime Number Keys
Rini Marwati

Universitas Pendidikan Indonesia

Abstract

Message security can be achieved using the one-time pad cryptography technique. One-time pad is considered as a perfect cryptography because it provides absolute secrecy. However, its key management is inefficient due to the requirement for random, non-reusable keys equal in length to the message length. In this article, we propose a modification of the one-time pad that utilizes prime numbers as the basis for key generation. The idea is inspired by the mathematical fact that the square root of a prime number is irrational, providing a non-repeating and non-terminating sequence that can serve as a pseudo-random source for key expansion. This concept is expected to produce an efficient one-time pad by maintaining high levels of randomness and unpredictability while reducing the need for excessively long key storage.

Keywords: cryptography, irrational number, key generation, one-time pad, prime number

Topic: Mathematics and Mathematics Education