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.
375
questions
2
votes
3
answers
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 ...
- 511
1
vote
1
answer
43
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 ...
- 111
1
vote
1
answer
40
views
Compute OTP key if set of plain texts and its set of cipher texts are known
Given a set of plain texts $P \subseteq \{0, 1\}^n$. Assume we know the corresponding set of cipher texts $C \subseteq \{0, 1\}^n$ produced by applying one-time pad with an unknown key $k \in \{0, 1\}^...
- 111
5
votes
1
answer
124
views
Perfectly secret variable one-time pad
Consider a variable one-time pad, that is, $\mathcal{M}:=\{0,1\}^{\leq \ell}$ is the set of plain text. Now, this scheme is not perfectly secret, since you can take two plain text of different size, ...
- 53
1
vote
1
answer
144
views
How could unbreakable encryption be used?
I'm part of a team of students from the Vienna University of Economics, which have the task to find application fields for a new technology. The technology itself is provided by an external partner, ...
0
votes
2
answers
82
views
Is this a scenario where reuse of a One Time Pad is acceptable?
I require an encryption algorithm that requires two parties with two different keys to be able to decrypt it. I could double AES encrypt, but I am instead considering AES encryption followed by a OTP ...
- 11
1
vote
1
answer
62
views
Is it possible to decrypt my message if encrypt it twice using different keys each time?
Suppose I want to encrypt $mssg$ using One-Time-Pad, and I want the $mssg$ to be encrypted twice.
Once with $k_1$ and second with $k_2$
Is it still possible to detect my $mssg$?
lets say:
$c_1 = mssg ...
- 13
1
vote
1
answer
62
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 ...
- 13.8k
0
votes
1
answer
77
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
2
votes
2
answers
153
views
What's bad about idea of public-key/one-time-pad hybrid cryptosystem?
As i know, generally nowadays hybrid protocols are more widely used than either symmetric or public key cryptosystems separately. I read that public key system is used to exchange and share secret via ...
- 71
0
votes
0
answers
50
views
Breaking vigenere cypher using the one-time pad flaw when used for a second time
I got an idea which may be wrong because I may have missed some important factor but for the moment I don't know if I really did. Let BM be the method used to break a reused one-time pad cipher (which ...
- 1
0
votes
0
answers
59
views
Purpose of modulus in one-time pad?
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 ...
1
vote
0
answers
89
views
One time pad, Proof for a problem
We know 2 plaintexts of length L and 2 ciphertexts of length L(we don't know which one belongs which), assuming each given ciphertext is generated by encrypting one of the given plaintexts by XOR'ing (...
- 11
0
votes
0
answers
144
views
cracking a one time pad using key reuse
There is a one time pad which works as follows:
given message "hello" and key "asdfg", it produces "hwoqu". It only works with the 26 english letters. The output is (h(7) ...
- 101
0
votes
1
answer
92
views
One-time pad without zero: proof check
I started learning cryptography and tried to work through this problem: consider one-time pad where $\mathcal{M}=\mathcal{C}=\{0,1\}^n$ and $\mathcal{K}=\{0,1\}^n\setminus 0^n$ (call this scheme $\Pi$)...
- 21
1
vote
3
answers
83
views
Derivating random numbers from random numbers
If I have a "truly random number" $K$ of $L$ bits (whatever "truly random" means... is it a value from a normal distribution a truly random number, or only uniform distributions ...
- 25
0
votes
0
answers
25
views
Decrypting two time pad using the Vigenère scheme
If I define that $$m\oplus k :=(m+k) \mod 26$$ where A is 0 and Z is 25. How do I efficiently/properly decrypt if I was given two-time pad ciphered texts? I know that $m_1\oplus m_2 = c_1\oplus c_2$. ...
- 1
2
votes
1
answer
1k
views
Is OTP still perfectly secure if we limit message and key space
If we have a message space M {0,1,2,3,4,5,6} and likewise keyspace is K = {0,1,2,3,4,5,6} (generator choosen uniform keys k)
We define our encryption to be the XOR of their bitwise rep on K and M ...
- 43
6
votes
3
answers
2k
views
Why is mod calculation necessary in a one time pad encryption?
Considering the English alphabets to be encrypted why is the computation of mod 26 necessary after adding the pad to plain text. Is it just that it adds to another level of encryption or is it used so ...
- 163
2
votes
1
answer
147
views
What is the correct order of operations for one-time pad cipher when using subtraction and mod 10 arithmetic?
What would be the proper order of operations for OTP encryption/decryption when using subtraction and mod 10? E.g. P - K = C or K - P = C
Most of the sources I have seen do not cover this topic or I ...
- 21
0
votes
1
answer
165
views
What is a ciphertext only attack and how OTP is unbreakable using this attack
I was wondering that what actually is cipherText-only attack and how the One Time Pad Encryption cant be broken by this attack?
- 11
0
votes
2
answers
448
views
One-time-pad Encryption in C
I have been messing around with cryptography (for recreational use), and I created my own one-time-pad encryption script in C. Now, with that being said, I freely admit that I am by no means a ...
1
vote
1
answer
43
views
Securing counter value for OTP [closed]
I'm working on a project that needs an OTP based on counter value and needs some advice.
Suppose we encrypt the counter value C in this way and let's say our sending packet is P = AES(key,C). If ...
- 11
2
votes
2
answers
90
views
Combining ECC and AES for a Web Chat system
I am working on a portable secure chat via desktop or mobile, which adopts OTP plus asymmetric encryption. The idea goes like this:
Suppose that Alice and Bob are clients, and the server is run by ...
- 334
2
votes
1
answer
71
views
Multiplication encryption with a small number
Given a big number $x$(1024 bits) and a large prime $N$($N>x$), I want to encrypt it with a smaller number $y$(128 bits).
$$Enc(x) = xy \mod{N}.$$
Is it safe? If not, how do I evaluate its leakage?
- 21
3
votes
2
answers
104
views
Using $key^{th}$ multiple of $\pi$ as a one-time pad
With a key $k$ of sufficient length, say 128 bits, is it possible to use $k^{th}$ multiple of $\pi$ as a one-time pad?
Please enlighten on the security as well as practical aspects (only if secure of ...
- 319
2
votes
1
answer
496
views
AES or One-time-pad for encrypting a single 128bit block?
I just started my network security course and came across the below question. Could some one help me here.
User A wish to send a 128-bit secret message, S, to user B. As the preliminary step, both A ...
- 21
1
vote
3
answers
368
views
Is collision resistant hash enough for one-block counter mode?
Let $H:\{0,1\}^*\rightarrow \{0,1\}^\ell$ be a collision resistant hash function (CRH), and let $\Pi = (\mathsf{enc,dec})$ be an encryption scheme with the following properties:
$\Pi.\mathsf{enc}: \...
- 413
1
vote
1
answer
49
views
Is it possible to attack a one-time pad encrypting only slightly more than its length?
This question might be uncannily similiar to this one posted over 6 years ago, but the structure is completely different.
It's written nearly everywhere that OTPs are incapable of sustaining more than ...
BasedUser
2
votes
1
answer
111
views
basic question regarding two-time pad attack
Dan Boneh's Crypto 1 Course includes a lesson on stream ciphers with the following slide:
He asks the question:
And the answer he gives is $m \oplus p$, which is why this is insecure.
But I don't ...
- 133
0
votes
0
answers
76
views
If $\mathrm{P}=\mathrm{NP}$ were efficiently solvable, how would Internet security work? [duplicate]
Suppose $\mathrm{P}=\mathrm{NP}$ were proven and a practical low-degree (2 or 3) polynomial algorithm was found before widespread quantum key distribution was available. How would internet security ...
- 11
1
vote
2
answers
63
views
One Time Pad Low Bandwidth Doubt from the book
Following is a sentence from the book "Cryptography and Network Security - Principle and Practices" by William Stallings [Fourth Edition]
Sentence -
"
... the 'one-time pad' is of ...
- 11
0
votes
2
answers
5k
views
How to decrypt two images encrypted using XOR with the same key?
I am trying to solve the following puzzle from CryptoHack involving two images encrypted with the same key:
I've hidden two cool images by XOR with the same secret key so you can't see them!
lemur....
- 1,678
0
votes
0
answers
131
views
One-time pad: Using Cribdrag for Decipherment and Key Recovery
I have been given three different strings:
...
- 117
3
votes
3
answers
448
views
Can anyone explain to me the difference between the OTP (one-time pad) and Vernam Cipher?
I heard they are very similar, although there are subtle differences between the two.
0
votes
1
answer
51
views
Pencil & paper encryption, some thoughts on polyalphabetic techniques [closed]
I have an idea for a simple cipher that builds on old techniques that I thought I would share with this group. It has probably been done but I have not been able to find a reference to it.
Given two ...
- 1
4
votes
1
answer
111
views
Does a one-time pad of digits 0-9 have any weaknesses?
I'm working on one of those unsolved puzzles, and one theory I have is that one or more sections of it are using digits of pi, e, or some other irrational number as a one-time pad.
(The obvious ...
- 141
1
vote
2
answers
119
views
Stream cipher vs OTP, with /dev/urandom and secure key exchange
My application will work in an office setting where a user can directly and securely collect a long One Time Pad. For example, it may be 16Gb on a USB drive. This would fill me with joy except that ...
- 127
0
votes
0
answers
45
views
Practical One Time Pad Based on Diminished Rate of Random Number Exhaustion [duplicate]
One reason why One Time Pads are impractical is that sender and receiver need copies of the same random numbers. This can quickly exhaust the set of numbers if communication is frequent.
Proposal: The ...
- 35
-2
votes
2
answers
237
views
Is this a provably secure scheme to encrypt a private key?
I got this idea to use the features of the one-time pad, an encryption technique that provably cannot be cracked, but this time applied to encrypt a private key. A possible application could be to ...
- 237
0
votes
1
answer
50
views
Having two messages and a result ciphertext, is it possible to know which one was encrypted using One Time Pad?
I have two messages $m_1$ and $m_2$ and a result ciphertext $c$, one-time pad was used to create the ciphertext $c$, is it possible to know which message was used to generate the ciphertext $c$?
2
votes
1
answer
53
views
Crypto scheme to map data to users in a way that is anonymous to database server
I am trying to finish a paper on censorship resistant data-sharing systems in semi-centralized ways. I know the below threat model can be mitigated by using decentralized system, but I am looking for ...
- 21
0
votes
0
answers
93
views
How secure is the encryption with OTP and an OneRNG?
I bought an HWRND last week. What do you think, how secure is the encryption with that and the OTP? See the OneRNG theory of operation here.
- 49
1
vote
1
answer
216
views
How to combine a PRG and a non-PRG to design a PRG?
I'm trying to solve the following exercise:
Let $G_1, G_2: \{0,1\}^\lambda \to \{0,1\}^{\lambda + l}$ be two deterministic functions mapping $\lambda$ bits into $\lambda + l$ bits (for $l \ge 1$). You ...
- 111
4
votes
2
answers
1k
views
One time pad - how is the difference in length between the plain text & the OTP handled?
Since OTP have to be agreed upon in advance, they may be longer than the plaintext. So in this case, how is the encryption done? Is the OTP truncated to the same length of the plaintext before ...
- 1,678
0
votes
0
answers
86
views
How does the entropy of $r$ influence the security of the one-time pad $F_k(r) \oplus m$?
In an one-time pad scheme, $s \oplus m$ is uniformly random for any $m \in \{ 0,1 \}^\ell$ if $s$ is uniform in $\{ 0,1 \}^\ell$. By the security of PRF, it seems to be secure to replace the truly ...
- 187
0
votes
0
answers
134
views
GPG + OTP--Would that be authenticated encryption?
Here is a GPG message, signed and encrypted (strictly for demonstration, with test keys):
...
- 1
-1
votes
1
answer
170
views
Does the following protocol of secure a matrix satisfy one-time-pad?
Problem Definition:
Alice wants to send a matrix $MR_A$ which encrypts its original private matrix $M_A$ ($M\times N$ size, all elements in $M_A$ is in {0,1,2,3,4,5}) to Bob without letting Bob knows ...
- 13
1
vote
1
answer
99
views
Authenticated, Quantum-resistant GPG2?
GPG2 does not provide authentication. It still uses SHA-1 by default. It does not seem to get any stronger as time goes by.
If one were to pass a randomly-generated symmetric key (from a TRNG) over ...
- 11
3
votes
2
answers
3k
views
Can you use repeating numbers like $\pi$, and $e$, as the Key to OTP ciphers?
Since $\pi$ and other numbers repeat could you use them as a OPT key. Ex: a 5 character message is sent and the first 5 digits of $\pi$ are used. after that the next $X$ number of digits are used and ...
- 41