How to know the difference between two ciphertexts without key stream in stream ciphers
$begingroup$
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 3F 5C AB}$$
$$C_2: texttt{90 C6 A1 1E E6 F3 31 2B 37 4A B6}$$
$C_1$ is encrypted as ($P_1 oplus text{Keystream}$) and $C_2$ by ($P_2 oplus text{Keystream}$) where $P_1$ and $P_2$ are corresponding plaintexts.
- I am asked to tell how can I differentiate between corresponding plain text $P_1$ and plain text $P_2$ from $C_1$ and $C_2$ as an attacker without knowing the keystream?
So, I think the answer would be since both ciphers are encrypted through the same key stream, they would have similarities where the same plain text and keystream value exists. In this way, I can differentiate the other parts of the plain text. Is there anything more to it?
Thanks.
encryption stream-cipher
New contributor
$endgroup$
add a comment |
$begingroup$
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 3F 5C AB}$$
$$C_2: texttt{90 C6 A1 1E E6 F3 31 2B 37 4A B6}$$
$C_1$ is encrypted as ($P_1 oplus text{Keystream}$) and $C_2$ by ($P_2 oplus text{Keystream}$) where $P_1$ and $P_2$ are corresponding plaintexts.
- I am asked to tell how can I differentiate between corresponding plain text $P_1$ and plain text $P_2$ from $C_1$ and $C_2$ as an attacker without knowing the keystream?
So, I think the answer would be since both ciphers are encrypted through the same key stream, they would have similarities where the same plain text and keystream value exists. In this way, I can differentiate the other parts of the plain text. Is there anything more to it?
Thanks.
encryption stream-cipher
New contributor
$endgroup$
1
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday
add a comment |
$begingroup$
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 3F 5C AB}$$
$$C_2: texttt{90 C6 A1 1E E6 F3 31 2B 37 4A B6}$$
$C_1$ is encrypted as ($P_1 oplus text{Keystream}$) and $C_2$ by ($P_2 oplus text{Keystream}$) where $P_1$ and $P_2$ are corresponding plaintexts.
- I am asked to tell how can I differentiate between corresponding plain text $P_1$ and plain text $P_2$ from $C_1$ and $C_2$ as an attacker without knowing the keystream?
So, I think the answer would be since both ciphers are encrypted through the same key stream, they would have similarities where the same plain text and keystream value exists. In this way, I can differentiate the other parts of the plain text. Is there anything more to it?
Thanks.
encryption stream-cipher
New contributor
$endgroup$
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 3F 5C AB}$$
$$C_2: texttt{90 C6 A1 1E E6 F3 31 2B 37 4A B6}$$
$C_1$ is encrypted as ($P_1 oplus text{Keystream}$) and $C_2$ by ($P_2 oplus text{Keystream}$) where $P_1$ and $P_2$ are corresponding plaintexts.
- I am asked to tell how can I differentiate between corresponding plain text $P_1$ and plain text $P_2$ from $C_1$ and $C_2$ as an attacker without knowing the keystream?
So, I think the answer would be since both ciphers are encrypted through the same key stream, they would have similarities where the same plain text and keystream value exists. In this way, I can differentiate the other parts of the plain text. Is there anything more to it?
Thanks.
encryption stream-cipher
encryption stream-cipher
New contributor
New contributor
edited 2 days ago
kelalaka
8,78032351
8,78032351
New contributor
asked 2 days ago
TahirTahir
183
183
New contributor
New contributor
1
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday
add a comment |
1
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday
1
1
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let's say $C_1 = P_1 oplus K$ and $C_2 = P_2 oplus K$ where $P$ is a plaintext, $K$ is the key stream and $C$ is the ciphertext.
Then if you XOR the two ciphertext together you get:
$$C_1 oplus C_2 =\
P_1 oplus K oplus P2 oplus K =\
P_1 oplus P_2$$
There are all kinds of interesting properties of the XOR of two plaintext together. For instance, one of the most common characters is the space, so you can easily guess many characters by just flipping a bit (space is 0x20
or 0b0010_0000
after all). You can see that a lot of combinations are not possible or unlikely and you can perform frequency analysis.
This becomes even more powerful if you have 3 or more ciphertexts, as you can compare each and every pair, and if there are $n$ ciphertext then there are ${n cdot (n - 1)} over 2$ combinations to be made.
$endgroup$
add a comment |
$begingroup$
In the stream-ciphers, same key-stream is not used two times, I mean that when you encrypt P1 with a Keystream (P1⊕Keystream), the same key-stream should never used for encrypting P2 (P2⊕Keystream). if you use same key-stream for two different encryption, then you cipher-texts are susceptible to "two time pad Attack". In this attack, Attacker captures C1 and C2 which they are encrypted in this way:
C1 = (P1⊕Keystream)
C2 = (P2⊕Keystream)
Then attacker works out C1 ⊕ C2; which leads to P1 ⊕ P2. We know that (Keystream ⊕ Keystream = 1).
Now attacker bases on some characteristics of plaintext (P1,P2) such as redundancy of ASCII codes, we can get the original plaintext.
But we should remember that we use IV beside the Key for preventing of producing the same keystream.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "281"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Tahir is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f68576%2fhow-to-know-the-difference-between-two-ciphertexts-without-key-stream-in-stream%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let's say $C_1 = P_1 oplus K$ and $C_2 = P_2 oplus K$ where $P$ is a plaintext, $K$ is the key stream and $C$ is the ciphertext.
Then if you XOR the two ciphertext together you get:
$$C_1 oplus C_2 =\
P_1 oplus K oplus P2 oplus K =\
P_1 oplus P_2$$
There are all kinds of interesting properties of the XOR of two plaintext together. For instance, one of the most common characters is the space, so you can easily guess many characters by just flipping a bit (space is 0x20
or 0b0010_0000
after all). You can see that a lot of combinations are not possible or unlikely and you can perform frequency analysis.
This becomes even more powerful if you have 3 or more ciphertexts, as you can compare each and every pair, and if there are $n$ ciphertext then there are ${n cdot (n - 1)} over 2$ combinations to be made.
$endgroup$
add a comment |
$begingroup$
Let's say $C_1 = P_1 oplus K$ and $C_2 = P_2 oplus K$ where $P$ is a plaintext, $K$ is the key stream and $C$ is the ciphertext.
Then if you XOR the two ciphertext together you get:
$$C_1 oplus C_2 =\
P_1 oplus K oplus P2 oplus K =\
P_1 oplus P_2$$
There are all kinds of interesting properties of the XOR of two plaintext together. For instance, one of the most common characters is the space, so you can easily guess many characters by just flipping a bit (space is 0x20
or 0b0010_0000
after all). You can see that a lot of combinations are not possible or unlikely and you can perform frequency analysis.
This becomes even more powerful if you have 3 or more ciphertexts, as you can compare each and every pair, and if there are $n$ ciphertext then there are ${n cdot (n - 1)} over 2$ combinations to be made.
$endgroup$
add a comment |
$begingroup$
Let's say $C_1 = P_1 oplus K$ and $C_2 = P_2 oplus K$ where $P$ is a plaintext, $K$ is the key stream and $C$ is the ciphertext.
Then if you XOR the two ciphertext together you get:
$$C_1 oplus C_2 =\
P_1 oplus K oplus P2 oplus K =\
P_1 oplus P_2$$
There are all kinds of interesting properties of the XOR of two plaintext together. For instance, one of the most common characters is the space, so you can easily guess many characters by just flipping a bit (space is 0x20
or 0b0010_0000
after all). You can see that a lot of combinations are not possible or unlikely and you can perform frequency analysis.
This becomes even more powerful if you have 3 or more ciphertexts, as you can compare each and every pair, and if there are $n$ ciphertext then there are ${n cdot (n - 1)} over 2$ combinations to be made.
$endgroup$
Let's say $C_1 = P_1 oplus K$ and $C_2 = P_2 oplus K$ where $P$ is a plaintext, $K$ is the key stream and $C$ is the ciphertext.
Then if you XOR the two ciphertext together you get:
$$C_1 oplus C_2 =\
P_1 oplus K oplus P2 oplus K =\
P_1 oplus P_2$$
There are all kinds of interesting properties of the XOR of two plaintext together. For instance, one of the most common characters is the space, so you can easily guess many characters by just flipping a bit (space is 0x20
or 0b0010_0000
after all). You can see that a lot of combinations are not possible or unlikely and you can perform frequency analysis.
This becomes even more powerful if you have 3 or more ciphertexts, as you can compare each and every pair, and if there are $n$ ciphertext then there are ${n cdot (n - 1)} over 2$ combinations to be made.
edited 2 days ago
answered 2 days ago
Maarten Bodewes♦Maarten Bodewes
55.8k679196
55.8k679196
add a comment |
add a comment |
$begingroup$
In the stream-ciphers, same key-stream is not used two times, I mean that when you encrypt P1 with a Keystream (P1⊕Keystream), the same key-stream should never used for encrypting P2 (P2⊕Keystream). if you use same key-stream for two different encryption, then you cipher-texts are susceptible to "two time pad Attack". In this attack, Attacker captures C1 and C2 which they are encrypted in this way:
C1 = (P1⊕Keystream)
C2 = (P2⊕Keystream)
Then attacker works out C1 ⊕ C2; which leads to P1 ⊕ P2. We know that (Keystream ⊕ Keystream = 1).
Now attacker bases on some characteristics of plaintext (P1,P2) such as redundancy of ASCII codes, we can get the original plaintext.
But we should remember that we use IV beside the Key for preventing of producing the same keystream.
$endgroup$
add a comment |
$begingroup$
In the stream-ciphers, same key-stream is not used two times, I mean that when you encrypt P1 with a Keystream (P1⊕Keystream), the same key-stream should never used for encrypting P2 (P2⊕Keystream). if you use same key-stream for two different encryption, then you cipher-texts are susceptible to "two time pad Attack". In this attack, Attacker captures C1 and C2 which they are encrypted in this way:
C1 = (P1⊕Keystream)
C2 = (P2⊕Keystream)
Then attacker works out C1 ⊕ C2; which leads to P1 ⊕ P2. We know that (Keystream ⊕ Keystream = 1).
Now attacker bases on some characteristics of plaintext (P1,P2) such as redundancy of ASCII codes, we can get the original plaintext.
But we should remember that we use IV beside the Key for preventing of producing the same keystream.
$endgroup$
add a comment |
$begingroup$
In the stream-ciphers, same key-stream is not used two times, I mean that when you encrypt P1 with a Keystream (P1⊕Keystream), the same key-stream should never used for encrypting P2 (P2⊕Keystream). if you use same key-stream for two different encryption, then you cipher-texts are susceptible to "two time pad Attack". In this attack, Attacker captures C1 and C2 which they are encrypted in this way:
C1 = (P1⊕Keystream)
C2 = (P2⊕Keystream)
Then attacker works out C1 ⊕ C2; which leads to P1 ⊕ P2. We know that (Keystream ⊕ Keystream = 1).
Now attacker bases on some characteristics of plaintext (P1,P2) such as redundancy of ASCII codes, we can get the original plaintext.
But we should remember that we use IV beside the Key for preventing of producing the same keystream.
$endgroup$
In the stream-ciphers, same key-stream is not used two times, I mean that when you encrypt P1 with a Keystream (P1⊕Keystream), the same key-stream should never used for encrypting P2 (P2⊕Keystream). if you use same key-stream for two different encryption, then you cipher-texts are susceptible to "two time pad Attack". In this attack, Attacker captures C1 and C2 which they are encrypted in this way:
C1 = (P1⊕Keystream)
C2 = (P2⊕Keystream)
Then attacker works out C1 ⊕ C2; which leads to P1 ⊕ P2. We know that (Keystream ⊕ Keystream = 1).
Now attacker bases on some characteristics of plaintext (P1,P2) such as redundancy of ASCII codes, we can get the original plaintext.
But we should remember that we use IV beside the Key for preventing of producing the same keystream.
answered 2 days ago
Arsalan VahiArsalan Vahi
1067
1067
add a comment |
add a comment |
Tahir is a new contributor. Be nice, and check out our Code of Conduct.
Tahir is a new contributor. Be nice, and check out our Code of Conduct.
Tahir is a new contributor. Be nice, and check out our Code of Conduct.
Tahir is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Cryptography Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f68576%2fhow-to-know-the-difference-between-two-ciphertexts-without-key-stream-in-stream%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Possible duplicate of Taking advantage of one-time pad key reuse?
$endgroup$
– Squeamish Ossifrage
yesterday
$begingroup$
More duplicates: crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/25299/…, crypto.stackexchange.com/questions/2249/…, crypto.stackexchange.com/questions/30425/…
$endgroup$
– Squeamish Ossifrage
yesterday