Linked Questions

0 votes
1 answer
1k views

many time pad attack [duplicate]

I am a beginner in cryptography. I studied many time pad attack and now I want to solve a popular exercise, It consists 11 ciphertexts (s1,s2,...,s11), that encrypted by a same key and I want to find ...
user47357's user avatar
1 vote
1 answer
2k views

One-time pad encryption of ASCII characters [duplicate]

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 ...
Lilz's user avatar
  • 153
0 votes
0 answers
42 views

Decrypting Message Using One-Time Pad with Repeated Key [duplicate]

I'm trying to decrypt a message that has been encrypted using a one-time pad with a repeated key. The encryption technique involves using the same key twice. We know the message was encrypted with $k =...
crypTOl23's user avatar
77 votes
3 answers
90k views

How does one attack a two-time pad (i.e. one time pad with key reuse)?

My question might appear the same as the question Taking advantage of one-time pad key reuse?, but actually I did read all the answers and none of them helped me with the details I need. I am new to ...
Samer Makary's user avatar
2 votes
1 answer
20k views

Many time pad attack (XOR) [duplicate]

The question is quite similar to Many time pad attack and I was trying to rely on the top answer, but still am a bit confused, so any explanation and help will be much appreciated. Assume I have a ...
xorbeginner's user avatar
0 votes
3 answers
5k views

Security of very simple XOR with random? [duplicate]

I am currently trying to implement a very fast and simple encryption algorithm in Lua for the purpose of using it with ComputerCraft. The main problem is that bitwise operations in Lua (5.2 at least) ...
TwoThe's user avatar
  • 189
3 votes
1 answer
8k views

Cryptanalysis of XOR cipher with repeated key phrase

My assignment is to cryptanalyze cipher text that we know was encrypted with a stream cipher (bitwise XOR of plain text and key stream), and decrypt to plain text. We know the key stream is a repeated ...
Joe's user avatar
  • 31
1 vote
1 answer
5k views

decryption many time pad [duplicate]

I have eleven ciphertexts that were encrypted with the same key (which I don't know). I want to decrypt the last ciphertext. I read similar question like Many time pad attack but I can't solve my ...
Mahdi_Nine's user avatar
2 votes
1 answer
2k 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 ...
13ros27's user avatar
  • 123
1 vote
1 answer
980 views

What does it mean when two encrypted files, encrypted with the same method but with different keys, when xor'd together, produce a repeating pattern?

Let's say I have fileA and fileB, both encrypted somehow, but in the same method with different keys. If I xor them together, they will make a repeating pattern of 32 bytes length. What does that say ...
jcao219's user avatar
  • 121
1 vote
2 answers
1k 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 ...
Ahmet mohit's user avatar
1 vote
3 answers
430 views

What are the vulnerabilities of this OTP-like system?

I've read that a OTP is only perfectly secure if the key is perfectly random, and the pad is never reused. If you encrypt documents using two keys, where one is random but stays constant for some ...
HammerN'Songs's user avatar
1 vote
1 answer
780 views

Analyzing/Breaking a strange One-Time-Pad

In my assignment there is a bonus question: It asks me to decrypt a file which has been encrypted using an One-Time-Pad. But the ciphertext seems to contain english word fragments and other parts ...
intrigus's user avatar
  • 113
2 votes
1 answer
175 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 $...
rranjik's user avatar
  • 217