Re-visiting the One-Time Pad

Nagaraj, Nithin and Vaidya, Vivek and Vaidya, Prabhakar G (2008) Re-visiting the One-Time Pad. International Journal of Network Security, 6 (1). pp. 94-102.

Re-visiting_the_One-Time_Pad.pdf - Published Version

Download (430kB)
Abstract: In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible OTP which is transmitted needs to have a length equal to the message length for this result to be true. In this paper, we prove that the length of the transmitted OTP actually contains useful information and could be exploited to compress the transmitted-OTP while retaining perfect secrecy. The message bits can be interpreted as True/False statements about the OTP, a private object, leading to the notion of private object cryptography.
Item Type: Journal Paper
Additional Information: Copyright of this article belongs to International Journal of Network Security.
Keywords: One time pad;Perfect secrecy;Private-key cryptography;Private-object cryptography;Shannon security;
Subjects: School of Natural and Engineering Sciences > Mathematical Modeling
Date Deposited: 06 May 2008 12:55
Last Modified: 08 May 2015 09:35
Official URL:
Related URLs:
    Funders: UNSPECIFIED
    Projects: UNSPECIFIED

    Actions (login required)

    View Item View Item