LLMpediaThe first transparent, open encyclopedia generated by LLMs

OTP

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Phoenix (software) Hop 4
Expansion Funnel Raw 51 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted51
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
OTP
NameOne-time pad
AbbreviationOTP
InventorGilbert Vernam; concept by Frank Miller
Introduced1917
FieldCryptography
RelatedVernam cipher, Claude Shannon, Information theory, Enigma machine, Diffie–Hellman key exchange

OTP

The one-time pad is a symmetric cipher scheme that achieves information-theoretic secrecy when correctly implemented. It uses a random key as long as the plaintext, combined by an operation such as bitwise XOR, to produce ciphertext; proponents and critics alike reference work by Claude Shannon, Gilbert Vernam, Shannon's information theory, Wyner, and institutions such as National Security Agency and Bletchley Park in historical and technical analyses. Implementations and incidents involving the technique appear in literature on Cold War communications, Soviet Union intelligence, Venona project, and modern discussions in post-quantum cryptography forums.

Definition and Overview

A one-time pad is defined as a cipher where plaintext is combined with a key stream composed of truly random material that is used only once and discarded. Formal proofs of perfect secrecy were given by Claude Shannon and discussed in works by Norbert Wiener and Alan Turing; operational descriptions appear alongside systems developed by AT&T engineers and patent filings by Gilbert Vernam. Real-world comparisons often cite Vernam cipher implementations, analyses by David Kahn in historical cryptography, and critiques in standards from National Institute of Standards and Technology.

Historical Development

Origins trace to proposals attributed to Frank Miller in telegraphy and patents by Gilbert Vernam at AT&T in 1917. During the World War I and World War II eras, one-time pad concepts influenced cipher equipment at Bletchley Park, operations of OSS, and diplomatic cipher practices in League of Nations archives. Postwar revelations—including decrypts from the Venona project and reporting by David Kahn—demonstrated both theoretical promise and practical failures when pads were misused; contemporaneous debate involved figures and agencies such as Alan Turing, John von Neumann, National Security Agency, and intelligence services of the Soviet Union and United Kingdom.

Types and Variants

Variants include classical additive pads using modulo addition as described by Gilbert Vernam and modern stream-like constructions using pseudorandom generators such as those based on RSA (cryptosystem), Advanced Encryption Standard, or Linear-feedback shift register architectures when true randomness is unavailable. Hybrid approaches reference constructions in Claude Shannon's work and later proposals in academic venues like IEEE, ACM, and papers presented at CRYPTO and Eurocrypt. Historical physical variants include paper pads used by diplomatic corps and microfilm-based pads used by agencies like the Central Intelligence Agency.

Security and Cryptanalysis

Perfect secrecy proofs trace to Claude Shannon's 1949 work; however, operational security depends on key generation, distribution, and destruction practices critiqued in analyses by David Kahn and case studies from the Venona project. Failures such as key reuse, poor randomness, or compromised key distribution are documented in incidents involving Soviet Union intelligence, misuse in field operations of OSS and MI6, and compromises corrected by agencies including National Security Agency. Cryptanalytic research comparing one-time pads to public-key schemes references breakthroughs like Diffie–Hellman key exchange and attacks cataloged in proceedings of USENIX and Black Hat conferences; mathematical treatments appear in texts by Thomas M. Cover and Joyce Poon.

Implementation and Practical Use

Operational deployments have ranged from diplomatic couriers using physical pads (noted in archives of United States Department of State) to secure messaging experiments by activists and journalists citing methods in Electronic Frontier Foundation materials. Modern implementations emphasize hardware true random number generators validated against standards from National Institute of Standards and Technology and design guidance from Internet Engineering Task Force drafts. Use cases contrast with public-key infrastructures such as X.509 certificate ecosystems, and logistics problems are compared to historical key-distribution challenges faced by Allied Powers and Axis powers during World War II.

Legal frameworks governing cryptographic tools involve agencies and statutes like National Security Agency, export controls influenced by Wassenaar Arrangement, and case law arising in jurisdictions that reference evidence handling from Federal Bureau of Investigation investigations. Ethical debates engage organizations such as the Electronic Frontier Foundation and scholars from institutions like Harvard Law School and Stanford Law School over balancing privacy, state surveillance, and law enforcement access. Historical ethical scrutiny has arisen from revelations in Cold War decrypts and subsequent public discourse led by journalists at outlets covering leaks and disclosures.

Category:Cryptography