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.

Filter by
Sorted by
Tagged with
0
votes
1answer
69 views

Can a message and one time pad each encrypted with separate ciphers be weaker than the stronger of either cipher?

Assume you have: A truly random one time pad, $P$ A plain text message, $M$ Two symmetric ciphers, $C_S$ and $C_W$, where $C_S$ is always more secure than $C_W$ Assume the keys have already been ...
4
votes
1answer
111 views

Using Diffie–Hellman without a key derivation function

In an answer to another question, it was suggested that the shared secret derived from Diffie–Hellman key exchange could then be used directly as a one-time pad to encrypt a message (by XORing the ...
2
votes
1answer
134 views

Why does the one-time pad not imply $P \not= NP$?

I apologize that this is a rather trivial question, but I haven't been able to find an answer anywhere. If the one-time pad is unconditionally secure and impossible to crack (with just ciphertext), ...
2
votes
2answers
121 views

OTP with fixed plaintext

I have just learned about the OTP, how it uses XOR, and how it's secure if the keys are random. But what will happen when the same plaintext is used again with a new key? $c_1 = k_1 ⊕ p$ $c_2 = k_2 ...
4
votes
1answer
172 views

Key length and message length in AES and perfect secrecy if plaintext length <= key length

As I understand it, a plaintext encrypted using a One Time Pad is uncrackable because all possible plaintexts of the same length are possible. As a concrete example, if you decrypt the first 3 bytes ...
4
votes
2answers
175 views

One-Time Pad: True or False

Suppose a message $M$ was encrypted with a one-time pad. If we learned the first half of the original text is some substring $s$, would we have a better chance of cracking the rest of the message? Is ...
1
vote
1answer
76 views

How to make this cipher strong?

Suppose I have an arbitrary 256 bit number $m$ another secret number $k$ of the same bit length, and then I multiply them both modulo a 256 bit prime number $p$ to get $c$ as follows: $$ c = (m\cdot k)...
2
votes
0answers
35 views

Attackability of one-time MAC when using block mode

Consider an encrypted message m which is encrypted with AES-CBC, so in addition to the message there is an IV supplied initially....
-3
votes
1answer
54 views

How much long the key should be to create a secure encryption with One Time Pad? [closed]

For example would a key with 15 random letters be enough to protect a 52 letters plain text?
1
vote
0answers
39 views

OTP Random Pad Renewal Without Extending Message

So I recently learned about the concept of a One Time Pad; and I from what I understand it means that if a XOR key is completely random and equal to or longer than the plaintext, it makes it so that ...
1
vote
3answers
81 views

Why use an OTP if you already have a secure channel

Let's say I have some sensitive information, and I want to encrypt it with a OTP and send it to the FBI or something. Now, in order for the recipient to successfully decrypt the message, he needs to ...
0
votes
2answers
95 views

Two possible plaintext's using OTP decryption

I am using this cipher-text c = 04 10 12 00 01 08 67 0A 19 65 0F 03 0A 00 with two possible keys ...
0
votes
0answers
39 views

Key size of a repeating key XOR-encrypted message using Hamming distance

To find possible key sizes for an encrypted message, I break the message into blocks with length s, ...
5
votes
3answers
618 views

In laymans terms, what exactly is a “One time pad”?

Background I am an undergraduate novice learning about cryptography. Recently my professor introduced us to the concept of a "One time pad". According to my professor: A one time pad is a cipher ...
1
vote
1answer
58 views

Infinite one time pads using a pseudorandom hash function [duplicate]

Paul Christiano writes (source): I’ll assume that we have some 256 bit cryptographic hash function F [...] The first important observation is that a 256-bit shared secret allows Alice and Bob to ...
0
votes
3answers
149 views

One Time Pad Key Distribution

For multiple OTP keys, why not do this: Key = Hash[(EC)DH Shared Secret + Counter] The counter will increase per message, and the output of the hash will be random for each new unique input into it. ...
1
vote
0answers
45 views

One Time Pad proof for Perfect Secrecy

In the book "Introduction to Cryptography with Coding Theory" by Trappe, in the paragraph about the security of the One Time Pad, is it told that given the set of possible plaintexts $P$, the set of ...
2
votes
0answers
36 views

decrypting a one-time-pad that outputs 0,1 in preknown probabilities

assuming a two users want to use a one time pad ciphersystem, and they are using a program that was developed by a third party that was supposed to create random undependable bits, but for some reason ...
0
votes
2answers
87 views

What operations provide perfect secrecy other than modulo addition

As far as I know OTP is the only algorithm proven to provide perfect secrecy. It can work with XOR which is addition modulo 2 and obviously it can work with additions modulo N. What other operations ...
2
votes
1answer
57 views

Running Key Gibbs Sampling

I am trying to implement the algorithm described in this paper. It uses blocked Gibbs sampling to perform a ciphertext-only attack on text encrypted with a running key cipher. However, I am confused ...
3
votes
1answer
178 views

How can recovered 5-letters plain text help me to recover reused OTP key

I have 10 cipher texts ciphered with One Time Pad (OTP) using the same key. I need to recover the key (or in other words, to recover the 11th cipher text which I assumed would require me to recover ...
1
vote
1answer
422 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 ...
0
votes
0answers
75 views

Using same key twice with Vigenere cipher

Could someone please give a walkthrough of how this works: Decrypting a vigenere cipher with a reused one-time pad. It was never fully answered with the example given in the comment. e.g Plaintext ...
1
vote
2answers
86 views

Is it possible to use an algorithm to generate an OTP?

I am a software developer, not a cryptologist. I like the idea of perfect secrecy and would like to use a one-time pad (OTP) to encrypt/decrypt files up to, say, 50Mb. Is there a way that I can use ...
5
votes
5answers
508 views

Why use complex encryption algorithms? [duplicate]

I have recently gotten interested in cryptography, so I looked some things up. I thought, why even use AES or DES or any other complex way for encrypting data when there are far simpler ways, like ...
1
vote
2answers
636 views

OTP stream cipher

I am new to cryptography, and there is one thing that is bothering me. I hope you can kindly help me to understand. Let's imagine an attacker harvests the plaintext as well the ciphertext from a ...
0
votes
4answers
940 views

Why do one-time pads not provide message authentication?

It is often said that one-time pads do not provide message authentication. But, if you and I have a one-time symmetric key, and I send you a message, and it is not complete gibberish, is that itself ...
-3
votes
2answers
268 views

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

If my plaintext alphabet is {0,1,2} has three characters, 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} . So key ...
1
vote
3answers
192 views

How can I quickly generate thousands of letters randomly, and strongly mitigate the risk of any compromise?

I want to generate English letters in a truly random manner without resorting to hand-thrown dice, despite their advantages. Rolling dice would be too slow and tiring as I need four thousand letters. ...
3
votes
5answers
792 views

Read-once memory

So I've been reading about cryptography and one-time pads, which seem to provide theoretically perfect secrecy. My question is does any form of technology today allow data to be stored in a practical ...
4
votes
1answer
1k views

How secure is my OTP program?

I'm writing a one-time pad encryption program because I got really interested in the idea of "encryption which has been proven to be impossible to crack if used correctly". I'm writing the program ...
2
votes
1answer
479 views

ChaCha20: is this a potentially safe way of using nonce derived from private key if the key/nonce pair is never reused, for a given plaintext?

Note: I realize in ChaCha20 the nonce should be random and unique each time follow certain constraints but am trying to determine whether there could be a safe way to use it just once if other ...
2
votes
3answers
207 views

How are one-time pads distributed?

It seems that OTP encryption is unbreakable. I have read some articles (Wikipedia, Blogpost, etc.), but I could not find any information about how they are used. If I wanted to create a messenger ...
9
votes
5answers
4k 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 ...
4
votes
4answers
2k views

One-time-pad encryption

As we know, intercepted ciphertext created by a one-time pad only reveals the length of the message. That is the only information the attacker can get since this ciphertext is unbreakable without the ...
1
vote
2answers
180 views

Modification of vigenere cipher cryptographically secure?

After looking for ages online for a python implementation of the Vigenere cipher, and finding few, I decided to implement it myself. After ironing out all of the flaws, it's now a working (and secure) ...
4
votes
2answers
211 views

When does multiple OTP encryption become insecure if new keys are permuted? ​

I understand that OTP encryption fulfils perfect secrecy, meaning you can't decrypt the encrypted text to it's original plaintext (and know that this plaintext is indeed the original plaintext) unless ...
0
votes
1answer
72 views

Why is this OTP decryption wrong? [closed]

i have a problem that goes: ...
0
votes
0answers
35 views

Partial key reuse in hash for one time pad cipher

There are 2 computers who are going to exchange lots of small packets of data between each other. To generate a shared secret, an elliptic key exchange takes place. If this key is hashed with the ...
2
votes
1answer
118 views

How does bit-wise operation work for encrypting grayscale images? [closed]

How does bit-wise operation work for encrypting grayscale images? In my Khan Academy course they encrypt an image with bitwise_and, ...
5
votes
1answer
164 views

Can I securely refill a one time pad over the same connection?

If you have a channel where you are communicating using a one time key, is it possible to receive additional key over that same connection without compromising security? Naively sending it through ...
84
votes
11answers
9k views

Is modern encryption needlessly complicated?

RSA, DES, AES, etc., all use (relatively) complicated mathematics to encrypt some message with some key. For each of these methods, there have been several documented vulnerabilities found over the ...
6
votes
2answers
970 views

Can we use numbers as a pad in the Vernam cipher - why or why not?

I was playing with the Vernam cipher on some online converter. But when I tried to encrypt my message string with numbers, it remained unchanged. Moreover, it was ignoring numbers and was encrypting ...
0
votes
1answer
162 views

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

I want to generate a 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?
3
votes
1answer
688 views

Authentication using a one-time pad

I am building a small embedded system of two nodes that communicate wirelessly. The microcontrollers I'm using are very limited: they only have 256 bytes of RAM. I would like to be able to ...
3
votes
1answer
938 views

One-time pad XOR question

For a one-time pad to be truly secure, do I need to use XOR? In other words, is a numerical OTP as secure as a XORed one? I'm new to cryptography, so this might not even make sense.
5
votes
2answers
698 views

Using a one-time pad with a block cipher

The one-time pad is often described with a simple XOR cipher. This is nice for showing the theoretical strengths of the one-time pad, but not so great in real-world scenarios where key reuse is a ...
6
votes
1answer
1k views

Hash functions to generate a one-time pad

Maybe this is a newbie question: Stream cypher, will XOR message bits with one-time pad bits. Suppose I have a pseudorandom number generator, like a Mersenne Twister or something similar. I could use ...
2
votes
1answer
186 views

Can Shannon's proof be applied to all ciphers

I have been studying Shannon's proof of Vernams (1917) unbreakable cipher. Can His proof be applied to positional ciphers?

1
2 3 4 5
7