Vigenere cipher strength of multiple keys?
If when using a Vignere cipher I replace the key word often with a word earlier in the ciphered plain text would this be stronger due to not being able to do analysis with a repeated key or would it be fundamentally weaker due to sending the key for the next message for everyone to see? How long do the messages need to be in terms of key length to make this method stronger?
For example:
The key word orange has been shared with 2 parties. The message "my password is bob and the next key word will be science" is encrypted using the word orange and sent to the second party. They then send me back a message using the key word science to encode their message as well as sending me a new key word.
cryptography
add a comment |
If when using a Vignere cipher I replace the key word often with a word earlier in the ciphered plain text would this be stronger due to not being able to do analysis with a repeated key or would it be fundamentally weaker due to sending the key for the next message for everyone to see? How long do the messages need to be in terms of key length to make this method stronger?
For example:
The key word orange has been shared with 2 parties. The message "my password is bob and the next key word will be science" is encrypted using the word orange and sent to the second party. They then send me back a message using the key word science to encode their message as well as sending me a new key word.
cryptography
add a comment |
If when using a Vignere cipher I replace the key word often with a word earlier in the ciphered plain text would this be stronger due to not being able to do analysis with a repeated key or would it be fundamentally weaker due to sending the key for the next message for everyone to see? How long do the messages need to be in terms of key length to make this method stronger?
For example:
The key word orange has been shared with 2 parties. The message "my password is bob and the next key word will be science" is encrypted using the word orange and sent to the second party. They then send me back a message using the key word science to encode their message as well as sending me a new key word.
cryptography
If when using a Vignere cipher I replace the key word often with a word earlier in the ciphered plain text would this be stronger due to not being able to do analysis with a repeated key or would it be fundamentally weaker due to sending the key for the next message for everyone to see? How long do the messages need to be in terms of key length to make this method stronger?
For example:
The key word orange has been shared with 2 parties. The message "my password is bob and the next key word will be science" is encrypted using the word orange and sent to the second party. They then send me back a message using the key word science to encode their message as well as sending me a new key word.
cryptography
cryptography
asked Nov 24 at 22:48
shai horowitz
1,497327
1,497327
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
This system does not add security, only weakens it: the first message can be solved in a standard way, being a Viginère cipher. For this we only need that the key is quite a bit shorter than the message we encrypt, and statistics will do the rest. After that you know from the solution what the next key will be so the attacker has a simpler time. Stereotypical beginnings are a weakness anyway, and I fail to see what "my password is bob" adds, if we are already using "orange" as key? Also use random strings, not dictionary words, as keys.
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: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3012194%2fvigenere-cipher-strength-of-multiple-keys%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
This system does not add security, only weakens it: the first message can be solved in a standard way, being a Viginère cipher. For this we only need that the key is quite a bit shorter than the message we encrypt, and statistics will do the rest. After that you know from the solution what the next key will be so the attacker has a simpler time. Stereotypical beginnings are a weakness anyway, and I fail to see what "my password is bob" adds, if we are already using "orange" as key? Also use random strings, not dictionary words, as keys.
add a comment |
This system does not add security, only weakens it: the first message can be solved in a standard way, being a Viginère cipher. For this we only need that the key is quite a bit shorter than the message we encrypt, and statistics will do the rest. After that you know from the solution what the next key will be so the attacker has a simpler time. Stereotypical beginnings are a weakness anyway, and I fail to see what "my password is bob" adds, if we are already using "orange" as key? Also use random strings, not dictionary words, as keys.
add a comment |
This system does not add security, only weakens it: the first message can be solved in a standard way, being a Viginère cipher. For this we only need that the key is quite a bit shorter than the message we encrypt, and statistics will do the rest. After that you know from the solution what the next key will be so the attacker has a simpler time. Stereotypical beginnings are a weakness anyway, and I fail to see what "my password is bob" adds, if we are already using "orange" as key? Also use random strings, not dictionary words, as keys.
This system does not add security, only weakens it: the first message can be solved in a standard way, being a Viginère cipher. For this we only need that the key is quite a bit shorter than the message we encrypt, and statistics will do the rest. After that you know from the solution what the next key will be so the attacker has a simpler time. Stereotypical beginnings are a weakness anyway, and I fail to see what "my password is bob" adds, if we are already using "orange" as key? Also use random strings, not dictionary words, as keys.
edited Nov 25 at 16:15
answered Nov 25 at 10:24
Henno Brandsma
105k346114
105k346114
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics 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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fmath.stackexchange.com%2fquestions%2f3012194%2fvigenere-cipher-strength-of-multiple-keys%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