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
1answer
21 views
Is it easier to crack the Vernam Cipher with more than two ciphertexts
I have just started looking into the cracking of the Vernam cipher with two ciphertexts encrypted with the same key by XORing them and then crib dragging and I was wondering if it is made easier if ...
0
votes
0answers
25 views
When Shamir secret sharing used in one time pad scheme
In the following, all operations are defined over a finite field of prime order. Please note that what I'm explaining below is a part of a bigger protocol, however, to keep things simple I just ...
-5
votes
0answers
35 views
one time pad cryptography [duplicate]
For One-time pad, it is required to never reuse the same key to encrypt two different messages. Suppose that Alice ignored this recommendation and decided to reuse the same key to encrypt two messages ...
1
vote
4answers
146 views
double encryption - One Time Pad
Can the security of the encryption system be improved by using double encryption with two randomly chosen keys?
By double encryption I mean using two keys K1 and K2, each 20-bit long, to obtain ...
0
votes
1answer
61 views
Is the One Time Pad secure in additive Rings?
Let's assume all operations are done on $\mathbb{Z}_p$ where $p$ is a large non-prime number.
To mask a value $a$, we do the following:
Pick a uniformly random value: $r$, from the ring.
Do as ...
2
votes
2answers
136 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
58 views
One-Time Pad Vulnerabilities [duplicate]
Why is it that a one time pad is vulnerable is the key is shorter than the message?
I know that if a key is reused across multiple plaintexts, you can XOR two existing ciphertexts to get the pad, but ...
0
votes
1answer
56 views
Simple One time Pad Probability
We have a one time pad where:
We have 8 bits. probability that a bit=0 is p.
The key is common for all 8 bits. It can have a value of 0 or 1 with equal probability.
After applying the XOR operation ...
0
votes
2answers
70 views
Is one time pad cipher reuse and random key secure?
The sender and receiver share two different secret keys: s1 and s2 both y bit values. 'x' is a randomly generated y bit value. The reader sends to the tag a challenge y = x ⊕ s1, and the receiver ...
2
votes
2answers
92 views
Is OTP with homomorphic encryption trivial?
If my key size is as large as the data I'm encoding, is it trivial to devise a theoretically secure homomorphic encryption scheme for integers (or else any finite/infinite group with order) that ...
3
votes
3answers
340 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'...
3
votes
2answers
224 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
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 "...
1
vote
1answer
71 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 ?
...
-1
votes
1answer
55 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 ...
17
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 ...
4
votes
2answers
115 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 ...
0
votes
0answers
33 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
72 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
91 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 ...
1
vote
1answer
80 views
One-Time-Pad with multiple keys?
Would it be more secure if we used multiple keys in a One-Time-Pad encryption?
2
votes
1answer
80 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
106 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
58 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
114 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
vote
1answer
91 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
2answers
138 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 ...
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 ...
0
votes
2answers
140 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
59 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 ...
-1
votes
1answer
104 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
2answers
66 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 ...
-5
votes
1answer
65 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 ...
0
votes
1answer
154 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
votes
2answers
158 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} . ...
1
vote
2answers
71 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 ...
1
vote
2answers
132 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 ...
-1
votes
3answers
469 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?
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 ...
1
vote
0answers
81 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
209 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\ ...
-4
votes
5answers
99 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
votes
3answers
446 views
Why wouldn't everyone encrypt with a One Time Pad? [duplicate]
A One Time Pad (OTP) sounds perfectly secure if we are to believe Wikipedia. But on the surface it also sounds ridiculously impractical - how does one securely distribute the OTP?
Idea: why not have ...
-1
votes
2answers
87 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. ...
3
votes
1answer
403 views
Proving one time pad is perfectly secret
I'm reading about one-time pad in "Introduction to Modern Cryptography" by Katz and Lindell. I can understand the definition of perfect secrecy. However, how is OTP proven to be perfectly secure ? I'm ...
0
votes
2answers
71 views
Is There any Risk to Using Meaningful Text as One Time Pad Key?
Let's say two people have the same edition of the same magazine. The knowledge that the magazine will be used as a one time pad is secret.
Is there any risk to using this as opposed to randomly ...
4
votes
1answer
266 views
Is the one-time pad still perfectly secret if all-zero keys are excluded?
I'm trying to solve this question related to one-time pads and perfect secrecy:
My solution is: I assumed that the current message space is $M = \left\{ 0,1 \right\}^l$ and the new keyspace after ...
-1
votes
1answer
72 views
Question on probability distribution
I computed $\Pr[\mathsf{CT} = 1] = \Pr[\mathsf{CT} = 2] = \Pr[\mathsf{CT} = 4] = 2/9$ and $\Pr[\mathsf{CT} = 3] = 1/3$.
When I calculate the first entry in the table, I get 1/2 not 1/9. Is my ...
0
votes
3answers
200 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 ...
