Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [one-time-pad]

A cipher which uses a different encryption key every time, as long as the message. The key is XOR'ed with the message to render the cipher text which can then be XOR'ed with the same key to get the plain text.

1
vote
3answers
183 views

What are some real world examples where one time pad encryption is used or can be used?

I understood that One-Time Pad (OTP) encryption ensures perfect secrecy. However, I couldn't find any real-world examples where the OTP is used. Also, which are some real-world examples where it won'...
2
votes
1answer
80 views

What is the difference between a Vigenère cipher and a one time pad cipher?

I'm doing a decryption competition at a nearby college. We are allowed one cheat sheet so I'm trying to make one. I realized that the Vigenère cipher was very similar to the one time pad and wanted ...
6
votes
4answers
2k views

Is One Time Pad considered Chosen-Plaintext Attack Secure?

If we're considering Chosen-Plaintext Attack setting, then the adversary has access to the Encryption Oracle right, and we know that OTP is only considered secure if we use the key only once. How ...
0
votes
0answers
108 views

Is this the right way to implement a One-time Pad? [closed]

Intro You can use it to secure files on your computer, online communication and/or lists of passwords where you only need to remember one to encrypt and decrypt the others. It uses a symmetric cipher....
0
votes
3answers
193 views

Strictly, is length(key) >= length(message) wrong for one time pads?

It's a common adage that for a perfectly secret one time pad, length(key) >= length(message) must hold. But that's wrong isn't it? At least very sloppy maths. Isn't the strict mathematical ...
6
votes
4answers
3k views

One Time Pads and “Bit Flip” Attacks

One Time Pads and Vulnerability to "Bit-Flip" Attacks: I've seen it in this group, and apparently there are a (small) number of voices on the 'net opining that those relying on OTP are essentially "...
8
votes
3answers
683 views

Is Poly1305 an information-theoretically secure MAC?

I have heard some people say that the Poly1305 authenticator is a "nuclear" MAC i.e. it is information-theoretically secure. After reading the paper I see it is based on the Wegman-Carter MAC which is ...
5
votes
2answers
556 views

Is there a companion algorithm for OTP to ensure integrity and/or authentication?

One-Time Padding is (theoretically) perfect encryption algorithm. Let's assume that these problems are solved: Fast generation of independent and identically distributed random variables Perfect key ...
15
votes
9answers
5k views

Is one-time pad encryption vulnerable when near identical data is sent many times with different OTP?

Let's assume a text file that grows at its very end but is otherwise not edited. We now have 100 transmissions of this, but OTP-encrypted (different OTP each time, of course). The first 50% of the ...
1
vote
1answer
71 views

Proof one-time pad is perfectly secret with eavesdropping game definition

I have the following definition of perfect secrecy (please assume that the probabilistic version is not available): If we consider the eavesdropping game given by: $$\begin{array}{|r | r|} \...
1
vote
1answer
64 views

One-time pad encryption - how does the receiving side decrypt the message?

If a message is sent using one-time pad scheme, which generates random bits in order to, for example, XOR them with the message's bits - how does the receiving side generate the exact series of bits ? ...
3
votes
4answers
680 views

Is the Vernam (One Time Pad) cipher useful? [duplicate]

By profession I’m a programmer. I don’t know a lot about how cryptographic algorithms are implemented, or even where I’d start, and I don’t know about cryptanalysis, but as I work in Blockchain ...
3
votes
4answers
231 views

Transferring Encrypted One-time pad over the internet

I was working with one-time pad, and as I understand , for one time pad to be 100% secure a key shouldn't be repeated. So assuming Alice and Bob have to exchange messages over the network secured over ...
-1
votes
1answer
51 views

Is a hash more or just equally representative of the first [hashlength] bytes of the hashed one-time pad?

[Clarification edit further down.] To distinguish already existing one-time pad files by their content instead of just their name ... ... is hashing meaningful? Or would the first X bytes (Length ...
-1
votes
2answers
76 views

How to be sure to retrieve the good key when brute-forcing a cipher?

Imagine the case of the one-time pad. It is proved to be secure because the key could be everything. We have no guarantee that this key or that key was the one used while encrypting our data. ...
4
votes
2answers
100 views

Generate one-time-pad with pre-shared key and public randomness

I know very little about cryptography, so I apologize if the question does not make sense. Let's say we design a function $F(P, X) \rightarrow K$ that takes in a pre-shared private key $P$ and a ...
1
vote
1answer
62 views

How to compare one time pad security and efficiency with AES?

It seems that the minimal size of Pseudorandom permutation (PRP) output is $128$ bits. In general, I'd like to see if there's any minimal size of the output of pseudorandom function (PRF) as well? for ...
2
votes
2answers
68 views

One Time Pad - does it work for long plain texts?

Reading Dirk Rijmenants's work on One Time Pad and he frequently mentions that it is suited to short plaintexts. I presume this is just because of the practicality of encrypting and decrypting one ...
0
votes
0answers
32 views

Vernam/OTP repeated pad vulnerability [duplicate]

One thing I know about the Vernam cipher is that the key must not be repeated over the plain-text, for example: ...
1
vote
1answer
71 views

One-Time-Pad with multiple keys?

Would it be more secure if we used multiple keys in a One-Time-Pad encryption?
-1
votes
3answers
326 views

is it possible to get key in One time pad if key is reused?

In one time pad, if $$\text{cipherText1} \oplus \text{cipherText2} = \text{plainText1} \oplus \text{plainText2}$$ then is it possible to find out key by 2 cipherText and plainText's X-or?
11
votes
3answers
3k views

One time pad: why is it useless in practice?

The symmetric cryptosystem one-time pad (OTP) seems to be very beautiful since it is perfectly secret according to Shannon. Many books, however, point out the main drawback: one must create a secret ...
0
votes
1answer
85 views

What algorithms to use for a secure transport protocol on devices with limited computing power

I am new to cryptography. My questions is this: I process packets on runtime. I do not have time for advanced encryption or decryption techniques that take a long time. As far as I know, going with ...
2
votes
1answer
76 views

Attacks on one-time pad, given a property of keys

An adversary $A$, eavesdrops $n$ cipher-texts, $c_{1}, c_{2} ..., c{_n}$. It also knows a value $v$ and a function $f$ such that $$f(k_{1}, k_{2}, ..., k_{n}) = v$$ where, $k_{i}$ is used to encrypt $...
1
vote
1answer
60 views

Decrypting a vigenere cipher with a reused one-time pad

I understand that when a plaintext is encrypted with a key of the same length, it is referred to as a one-time pad. Now when this key is reused to encrypt another plaintext, there is potential for ...
-3
votes
1answer
55 views

One-time pad question (Old ciphers) [closed]

The plaintext SECRETIVE is encrypted using One Time Pad with key DDDDDDDDD. Which of the following is TRUE? The ciphertext will be the same as using Caesar cipher with key of 4 The ciphertext is the ...
1
vote
2answers
98 views

Little problem with Vernam Cipher

We have got a task with the following content: Given is a language with 3 letters: A, B, C. The binary expression is: A = 000, B = 1111 and C = 0011 Two ...
-1
votes
2answers
13k views

How to XOR two hex values and am I doing crib dragging correctly? (OTP)

Let's say I have the two cipher texts 7ECC555AB95BF6EC605E5F22B772D2B34FF4636340D32FABC29B 73CB4855BE44F6EC60594C2BB47997B60EEE303049CD3CABC29B According to this website http://xor.pw/? the result ...
1
vote
2answers
97 views

Is it possible to use crib drag on base64 cipher text?

I am pretty new to the cryptography scene but I wanted to know if it is possible to use crib dragging on cipher text which doesn't contain words? This data would be encrypted using the same key with a ...
17
votes
1answer
26k views

How to attack a “many-time pad” based on what happens when an ASCII space is XORed with a letter?

I've already sent my correct solution to a homework exercise from Dan Boneh's Introduction to Cryptography class on Coursera: "Let us see what goes wrong when a stream cipher key is used more than ...
16
votes
5answers
3k views

Is a PRG more costly than AES or any other encryption standard?

I know that there are many encryption standards that take a key and sometimes an IV, and produces a cipher-text (the most prominent one is AES). These standards usually involve many rounds of addition ...
6
votes
6answers
595 views

Does humanly verifiable one time pad authentication exist?

Firstly some predicates:- Sufficient hardware generated one time pad key material. No pad reuse. Messages of 160 characters length (think Twitter). 28 characters only in use (A-Z, space and full stop ...
0
votes
2answers
124 views

Why does the key for a one-time pad have to be uniformly distributed? [duplicate]

I would like an intuitive argument for what goes wrong in the proof that that a one-time pad provides perfect secrecy, if the key $K$ is not chosen uniformly at random from the entire key space.
-3
votes
1answer
57 views

One Time Pad small key multiple times

i'm ask what is the wrong if i used small key multiple times in OTP .? for example : key .. . 10 10 10 10 10 10 plain .. 11 01 01 11 01 00 cipher 01 11 11 01 11 10 what can hacker know about ...
2
votes
2answers
54 views

Can one trade off the number of iterations for key length with the PBKDF2?

When using the PBKDF2, is one taking on significant risk if one chooses to lower the number of iterations and choose to have very long keys? Can I XOR my message with a a very long key (plain-text ...
-1
votes
2answers
136 views

OTP One Time Pad : How does modulus size greater than alphabet size eliminate perfect secrecy?

If my plaintext alphabet is {0,1,2}, it has three characters, and I understand why I cannot use a modulus less than 3 (decryption won't work). My key has 100 different values, {0,1,2 .....99} . ...
-5
votes
1answer
56 views

One Time Pad OTP: with modular math, ciphertext reveals modulus always, yes or no?

Assuming that in the OTP scheme, the key has more values than the alphabet, then: using modular math predetermines that the highest possible value in the ciphertext will reveal the modulus used in ...
1
vote
0answers
74 views

One-time pad encryption of ASCII characters

I can't understand a question I came across in a course. You observe three ciphertexts all resulting from encryption of ASCII plaintexts containing English letters and spaces only, using the ...
0
votes
4answers
1k views

Can the same One-Time-Pad be re-used with some tricks

Let’s say I have a message $m$ of $n$ bits. And a predetermined pad of $k*n$ bits. And for every bit $b$ of this message $m$, I’m creating random sequence $s$ of $k$ bits. I also have a predetermined ...
1
vote
2answers
66 views

One Time Pad OTP : Optimal modular base per given plaintext space?

Background: my question at : My pencil and paper One Time Pad works fine without modular math ...... or does it? I am trying to understand, from a layman's point of view, how to make the best one ...
3
votes
4answers
2k views

One time pad encryption

I hope, as we know intercepted ciphertext created by One-time pad encryption tells only length of the message, and that is only information attacker can get since this ciphertext its unbreakable to ...
1
vote
2answers
131 views

My pencil and paper One Time Pad works fine without modular math … or does it?

With no background in higher math or computer science, I could not quite grasp the value of modular math for simple OTP systems as described in other posts here. I have an alphabet size of 40 ...
7
votes
4answers
1k views

Is there a way to generate sound one-time pads out of public information?

Is there a way to 'mangle' a public data-source (for example, the current date in YYYYMMDD or the top New York Times headline) to form a one-time pad that will sufficiently hide the pad's source? ...
19
votes
7answers
10k views

What is the difference between a stream cipher and a one-time-pad?

A (synchronous) stream cipher is an algorithm which maps some fixed-length key to an arbitrary-length key-stream (i.e. a sequence of bits): $C : \{0,1\}^k \to \{0,1\}^{\infty}$. This key-stream is ...
2
votes
3answers
702 views

Does a stream cipher provide perfect secrecy?

From WAR10CK here: If I actually do create a machine using RC4 or AES-CTR and have a TRNG continually feed it a constant steady stream of random bits. Provided that the stream of bits is purged ...
3
votes
3answers
2k views

Can multiplication of two primes be seen as a strong cipher?

If we were define such a cipher: A reversible function that would accept a message $M$ and an initialization vector $\text{IV}_1$ $\operatorname{map}(\text{IV}_1, M)$ which can map an input $M$ to a ...
3
votes
2answers
1k views

Mathematical formula for switching the key for OTP?

Instead of generating the random key for the one time pad cipher over and over again, is there a mathematical formula that allows you to switch the key to a new key? The new key must be as random and ...
-4
votes
5answers
93 views

Multiple Encryption - One-Time Pad

It is known that One-Time Pad(OTP)s are theoretically unbreakable but impractical for use because of the size of the key length. But what if multiple encryption is used? Not to encrypt the first ...
1
vote
0answers
78 views

What is the fastest way to generate truly random one time pad without electrical or any other complicated device?

I want to generate truly random one time pad as fast as possible but without the use of any electrical or any other complicated device. What is the fastest way to do that?
1
vote
1answer
145 views

breaking one-time pad with key reuse

Suppose I have the message $m_1 = \sf{i\ like\ dogs}$. Suppose its one-time pad encryption with key $k$ is a given hexadecimal string of 22 characters. How would I encrypt a message $m_2 = \sf{i\ ...