Linked Questions

0
votes
1answer
48 views

Brute force strategy

I am a beginner in this field, and I was thinking about brute force strategies to break symmetric key encryption. Let's say we have a block cipher in CTR mode and the key is 56 bits in size. What ...
4
votes
4answers
1k 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 an OTP was used. Also, what are some real-world examples where it won't ...
4
votes
2answers
512 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 ...
0
votes
0answers
29 views

Many-time pad decryption [duplicate]

I have given seven cipher text encryted by the many-time pad. All are encrypted uwith the same random chosen secret key but I have no idea how to decrypt them. There are 7 ciphertexts: ...
1
vote
1answer
178 views

Why don't most encryption algorithms use perfect secrecy?

Isn't it possible to make algorithms that are both computationally complex and have many possible answers if you try to crack them without knowing the password? Why aren't many popular algorithms like ...
5
votes
1answer
511 views

What is the significance of IV in stream ciphers like Trivium?

In Trivium cipher, an 80-bit key and 80-bit IV (initialization vector) are used initially to set up the initial state. I would like to know, Role of IV in stream cipher? Can we make IV a secret ...
1
vote
1answer
176 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
vote
2answers
468 views

How to know the difference between two ciphertexts without key stream in stream ciphers [duplicate]

If I have two cipher texts lets say $C_1$ and $C_2$ of the same length encrypted through stream cipher technique using the same keystream. Let's say they are: $$C_1: \texttt{96 C6 A1 08 E7 F2 33 3B ...
-2
votes
2answers
106 views

Is there any vulnerability in this scheme?

We want to design a symmetric encryption scheme. Note that the following things are true for our system: The plaintext P will change every time for a given user. A user will choose a password which ...
1
vote
2answers
272 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) ...
1
vote
2answers
498 views

XOR and key reuse [duplicate]

I've been doing a bit of reading on the use of XOR and the dangers of key reuse. I'm aware that reusing a key can open a door for a frequency analysis attack on my plain text. So far, everything ...
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 ...
3
votes
3answers
898 views

Does ChaCha20 counter actually increment through iterations?

RFC defines: state = constants | key | counter | nonce Suggested on multiple places is to set counter to 0 or 1. It is still ...
0
votes
1answer
119 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 ...

15 30 50 per page