One-time pad

Known as: Onetime pad, One time code, One time key 
In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked if used correctly. In this technique, a plaintext is paired… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further… (More)
Is this relevant?
2016
2016
We have developed a one-time pad cryptographic method using a star network of N Lorenz subsystems, referred to as augmented… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
2016
2016
This paper provides standard instructions on how to protect short text messages with one-time pad encryption. The encryption is… (More)
Is this relevant?
2015
2015
Are one-time pads a thing of the past? There has been quite a bit discussion and some security and cryptography experts argue… (More)
Is this relevant?
2013
2013
We describe an encrypted communication principle that forms a secure link between two parties without electronically saving… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2013
2013
The one-time pad, the mother of all encryption schemes, is well known to be information-theoretically secure, in contrast to most… (More)
  • figure 2
  • figure 1
Is this relevant?
2012
2012
Top commands of the arm forces and some special military and government institutions need perfect security for exchanging between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system, also popularly known as the One-Time Pad (OTP… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2006
2006
A one-time pad [1] is a cryptographic protocol in which communicators Alice and Bob initially have correlated random variables… (More)
Is this relevant?
2002
2002
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g… (More)
Is this relevant?