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.

411 questions
Filter by
Sorted by
Tagged with
689 views

We use PRG to encrypt the message $m$ in the case of Pseudo one time pad instead of random string as in one time pad. Assuming G is PRG we prove that the scheme Pseudo one time pad is computationally ...
1 vote
69 views

### Key size for One Time Pad use with QKD

For a practical QKD implementation where OTP has been chosen for encrypting, how are key sizes determined? Say, for example, Alice wishes to exchange xGB to Bob, then a key management system should ...
145 views

### How to make a function which produces a hash of variable length?

I have been learning about OTP lately and I wondered, if I was to use it for encryption of a file (like a photo or even a video), I would need really looong key. Example program is simple: input is ...
• 23
101 views

In the Quantum One Time Pad, an $n$-qubit quantum state can be perfectly encrypted (as in the classical OTP) using $2n$ classical bits. In the classical OTP, I'm allowed to send many times the ...
• 87
142 views

### How do I generate a sequence of numbers with unpredictable differences

This question relates to bit flip attacks on OTP encrypted messages. Lets say I've got a list of numbers from 0 to 2^24-1 I want to re-order the list so it has the following property: If you start at ...
• 141
84 views

### Simplified MAC Algorithm

I would like to come up with a MAC algorithm that is simple and provably secure. The message and mac are OTP encrypted. For the purpose of this exercise lets say the entire plaintext is known to the ...
• 141
42 views

• 267
35 views

### Does XOR of message $m$ with $\mathrm{Enc}$ leak any information?

Let's suppose that $(G,D,E)$ is a secure encryption scheme, that is, for any polynomial $p(n)$ and any sequence of messages $\{a_{n}\},\;\{b_{n}\}$ of length $p(n)$ $E(k,a_{n})$ and $E(k,b_{n})$ are ...
• 131
55 views

### Proving if two samples hides a value?

Given two values $r'-r \mod q$ $i - r \mod q$ Where $r',r$ sampled randomly from $Z_q$ while i is pick arbitrarily from $Z_q$ and a secret Can we claim that this hides $i$? Here is my sketch: ...
282 views

### Advantages of AES vs XOR on a plain text file

Currently, I am using AES-GCM to encode and decode a plain text file. The key is derived from a plain text password using PBKDF2 and a random salt with SHA-256. However, I have been thinking and came ...
155 views

### Perfect Secrecy other than One-time Pad

The most known example cipher reaching perfect secrecy is One-time Pad, which employs modulus addition for encryption and decryption. Is there any other well-known cipher no less practical than OTP ...
• 153
1 vote
108 views

### Instead of asymetric encryption, why not use two One-time pad? [duplicate]

Why is the following protocol never used to share a symetric key between two parties ? ⊕ is the XOR operation. Alice has M and wants to send it to Bob. Alice generates K₁ randomly. Bob generates K₂ ...
1 vote
792 views

### Are the null bytes produced by a True Random Number Generator a security issue when using it as a source of entropy for keys in One-time pad?

I can see that True Random Number Generators can produce some null bytes, after some megabytes of data, even 2 consecutive null bytes are produced: ...
• 393
73 views

### May I use the same One-time pad key two times if I encrypt it with a block cipher using two different block cipher keys?

Let's suppose I have two 2GiB files and I want to encrypt them using One-time pad (Vernam cipher), but I don't want to store two big keys. May I use only one key for the two files if I encrypt the One-...
• 393
1k views

### If I hash different seeds with same size of hash output and XOR on plaintext, is it secure as One-time pad?

Let's suppose I take 1MiB of truly random data and split in pieces (seeds) of 32-bytes (256-bits), so I hash each seed with a hash function with the same output digest size (32-bytes/256-bits) and XOR ...
• 393
1k views

### If I encrypt a plaintext with different keys for each block, will I have the same security as a one-time pad?

Let's suppose I encrypt an 1MiB plaintext with AES-256 in ECB mode but using different keys for each 16-byte block (I know this is weird but it's just an example). Remembering that a different 256-bit ...
• 393
51 views

### How to use Pygame to do crib dragging [closed]

I have two files ctext0 and ctext1 that are byte files and they are encoded using the same one time pad, so I tried to write a pygame program to allow me to use crib-dragging to figure out some words ...
• 121
1 vote
152 views

### Is AES worse than OTP, if so is there proofs

My train of thought went, OTP is very secure if key is unknown because I am guessing the original message. AES on the other hand tells me I gave it the wrong key, and if I did I can just switch using ...
• 11
2k views

### Are one time pads still used, perhaps for military or diplomatic purposes?

The ME-600 key generator was developed in the early 1990s for generating truly random one time key streams. That's not exactly World War 1 or 2. I don't know how long it was used, or whether it ...
• 15.7k
126 views

### Paper based OTP and MAC

Consider the following paper based OTP Plaintext has 11 possible symbols 0-10. $C_i = M_i + K_i\ mod\ 11$. $K_i$ comes from a pre-shared key material which is never reused. How to introduce data ...
• 2,449
162 views

### Does authenticating fake Carter Wegman protected OTP messages consume key material at the receiving node?

Assume a message protocol whereby one time pad messages are authenticated with a Carter Wegman type hash on the ciphertext, or some similar construct utilizing a unique authentication key per message. ...
• 15.7k
265 views

### Security of using key size larger than the message digest size in HMAC, with one time pads

I would like to know the security of using key size that is larger than the message digest (output) of a HMAC in one time pad encryption. One time pads for the message and the key of HMAC are ...
1k views

This is a pretty open question, so I'm mostly looking for gut reactions from experts more educated than I. Given these assumptions which are easy to verify with a quick Google search: One Time Pads ...
• 169
1 vote
75 views

### Is combining hybrid encryption with OTP worthy?

I'm considering a case when after hybrid encryption (AES Key encrypted via RSA) RSA key will be "splited" like in OTP. On the end one side gets encrypted AES key and "half" key RSA,...
• 13
2k views

### Is it possible to create a pseudo-One Time Pad by using a key smaller than the plaintext?

Let's suppose I want to encrypt a 10GiB file but I don't want to use a One Time Pad, just a 1MiB key taken from /dev/random (in Linux). I know that the key should not be repeated, but is it possible ...
• 877
1 vote
96 views

### Question regarding a subset of p=?np

We consider a language that is $\{0,1\}^n$. We consider three variables $A$, $B$ and $K$ part of that language. A and K are generated through true random generator. We consider not two as is ...
815 views

### Why is AES better than one-time pad?

From my limited research into this topic, it seems that AES can be brute-forced. One-time pad, on the other hand, cannot. Why then is it better to use AES than it is to use one-time pad? The only ...
• 300
7k views

### Is there a security risk to use AES-CBC as stream cipher?

I am building a chat application where I want to encrypt each character while they are typing. I would require a stream cipher for that. I am planning to use AES-CBC mode with HMAC. Are there any ...
• 257
1 vote
210 views

### (In)security of multiplicative blinding / one-time-pad in a commutative ring

As I understand, the one-time pad can be generalized to any finite group. So, for example, if you consider $\mathcal{P} := \mathcal{C} := \mathcal{K} := \{0, 1, ..., 2^{n}-1\}$ for an integer n, and ...
• 45
1 vote
58 views

### Security of Reusing a One-Time Pad with Complement Messages with Errors

Let's say I have two binary messages ($m_0$ and $m_1$) of length $n$ which are bitwise complements of each other such that $$m_0 \xleftarrow{r} \{0,1\}^n \text{ and } m_1 = \overline{m_0}$$ If I ...
117 views

### Can cryptographically secure randomness be used to implement one time pad?

if I use an one time pad key generated using a cryptographically secure random source like python's secret module , to encrypt a message, will the one time pad scheme be secure? I think the entire ...
93 views

### Is this possible?

So I've been working on a project that aims to allow online distribution of one-time-pads securely. I understand that a pad cannot be reused and must be truly random, and that if it is compromised, ...
801 views

### Security of using AND instead of XOR operation for an OTP

With One-Time-Pads I have heard that it is preferential to use XOR because the ciphertext reveals no information about what the plaintext may have been (for each 0 ...
• 199
1 vote
193 views

### Is it necessary to (length) pad a fixed length one time pad in the presence of a HMAC?

Imagine a protocol where all one time pad messages are of a fixed length. And they're textual only, à la Truths/Tweets. So a short message would be padded with spaces (ASCII 32) up to the protocol's ...
• 15.7k
545 views

### Proof that the Family of Toeplitz Matrices is XOR-Universal

Definition of XOR-Universal hash functions by Abidin[1]: A class $H$ of hash functions from $M$ to $T$ is XOR-Universal$_2$ ($XU_2$) if there exist at most $|H|/|T|$ hash functions $h$ $\in$ $H$ such ...
1k views

### Doing OTP two or more times with a biased TRNG: Will this have the same security as if was done with a non-biased TRNG?

Let's suppose I want to do One-Time-Pad but I only have a biased true random number generator (TRNG). I XOR to the ciphertext block with another with random data got from the TRNG, e repeat the ...
• 877
1 vote
91 views

### What is the Work Factor of the one time pad?

Work Factor is defined as the minimum amount of work (can be the length of the key) to determine the secret key of an cryptosystem (HAC, Menezes, Alfred J. et al). And One time pad have unconditional ...
• 143
593 views

• 13
1 vote
132 views

### Where should MAC keys come from in a one time pad situation?

I refer to questions For a one-time pad, which MAC method is information-theoretically secure?, Seeking clarification of OTP & MAC discussion and this page illustrating various MACi. And the ...
• 15.7k
208 views

### Why do we need to use PRGs to generate random numbers for a one-time-pad? [duplicate]

I'm looking at the following idea for using a symmetric key to encrypt multiple messages (back & forth communication between Alice & Bob). It can be summarized as follows: Both sides agree ...
• 247
I have the following question and don't really understand it. I thought OTP offers perfect secrecy, why do we need modulus? Can somebody please help me answer the question? $Z_n$ denotes the ring of ...