Salsa20 Implementation: Sum of 2 Words with Carries SuppressedSecurity of Salsa20 with some known...
How to visualize the Riemann-Roch theorem from complex analysis or geometric topology considerations?
Potential client has a problematic employee I can't work with
Building an exterior wall within an exterior wall for insulation
How to deal with possible delayed baggage?
How to make ice magic work from a scientific point of view?
Is this ordinary workplace experiences for a job in Software Engineering?
Would tunnel walls be stronger if built using cut granite block walls reinforced with carbon based cords?
What is the wife of a henpecked husband called?
Why do neural networks need so many training examples to perform?
Why does magnet wire need to be insulated?
Early credit roll before the end of the film
Why do we have to make "peinlich" start with a capital letter and also end with -s in this sentence?
How does Leonard in "Memento" remember reading and writing?
Why avoid shared user accounts?
How can I play a serial killer in a party of good PCs?
How to assess the long-term stability of a college as part of a job search
Airplane generations - how does it work?
Citing paywalled articles accessed via illegal web sharing
local storage : Uncaught TypeError: Cannot set property 'innerHTML' of null
How do you funnel food off a cutting board?
Why are the books in the Game of Thrones citadel library shelved spine inwards?
What is the difference between "...", '...', $'...', and $"..." quotes?
Macro expansion inside href
Does diversity provide anything that meritocracy does not?
Salsa20 Implementation: Sum of 2 Words with Carries Suppressed
Security of Salsa20 with some known plaintext?Fast Salsa20 in java?IV re-use for Salsa20What kind of analysis can I perform on my implementation of Salsa20 and Rabbit ciphers?The Salsa20 core preserves diagonal shifts?Reuse nonce with Salsa20 stream cipher with counterOutput size of Salsa20384-bit ChaCha20 / Salsa20Salsa20 as a PRNG with streamsSalsa20 / ChaCha with 128 bit keys
$begingroup$
I'm working on the 2nd part of the Salsa20 spec, and I want to implement a closure for the exclusive-or of two words(u32). The author defines the operation as the sum of two words with carries suppressed, but what does "carries suppressed" mean. Then I come across some summation notation:
$u=sum_i2^iu_i$
What does the variable "i" mean in this context exactly? I understand summation notation and the index variable, but the context of the spec doesn't elaborate enough for me to know what "i" indexes.
I realize this all may be very rudimentary, but I am a programmer first.
modular-arithmetic xor salsa20
New contributor
$endgroup$
add a comment |
$begingroup$
I'm working on the 2nd part of the Salsa20 spec, and I want to implement a closure for the exclusive-or of two words(u32). The author defines the operation as the sum of two words with carries suppressed, but what does "carries suppressed" mean. Then I come across some summation notation:
$u=sum_i2^iu_i$
What does the variable "i" mean in this context exactly? I understand summation notation and the index variable, but the context of the spec doesn't elaborate enough for me to know what "i" indexes.
I realize this all may be very rudimentary, but I am a programmer first.
modular-arithmetic xor salsa20
New contributor
$endgroup$
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
$begingroup$
I'm working on the 2nd part of the Salsa20 spec, and I want to implement a closure for the exclusive-or of two words(u32). The author defines the operation as the sum of two words with carries suppressed, but what does "carries suppressed" mean. Then I come across some summation notation:
$u=sum_i2^iu_i$
What does the variable "i" mean in this context exactly? I understand summation notation and the index variable, but the context of the spec doesn't elaborate enough for me to know what "i" indexes.
I realize this all may be very rudimentary, but I am a programmer first.
modular-arithmetic xor salsa20
New contributor
$endgroup$
I'm working on the 2nd part of the Salsa20 spec, and I want to implement a closure for the exclusive-or of two words(u32). The author defines the operation as the sum of two words with carries suppressed, but what does "carries suppressed" mean. Then I come across some summation notation:
$u=sum_i2^iu_i$
What does the variable "i" mean in this context exactly? I understand summation notation and the index variable, but the context of the spec doesn't elaborate enough for me to know what "i" indexes.
I realize this all may be very rudimentary, but I am a programmer first.
modular-arithmetic xor salsa20
modular-arithmetic xor salsa20
New contributor
New contributor
edited 1 hour ago
DannyNiu
1,2441628
1,2441628
New contributor
asked 3 hours ago
whole_lotta_coinswhole_lotta_coins
132
132
New contributor
New contributor
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The sum of two words with carries suppressed is just a convoluted way of saying XOR. You don't need to implement any kind of complicated summation operation. Just perform a bitwise-exclusive OR.
See also https://en.wikipedia.org/wiki/Exclusive_or#Computer_science
$endgroup$
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
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
});
}
});
whole_lotta_coins 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%2f67635%2fsalsa20-implementation-sum-of-2-words-with-carries-suppressed%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
$begingroup$
The sum of two words with carries suppressed is just a convoluted way of saying XOR. You don't need to implement any kind of complicated summation operation. Just perform a bitwise-exclusive OR.
See also https://en.wikipedia.org/wiki/Exclusive_or#Computer_science
$endgroup$
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
$begingroup$
The sum of two words with carries suppressed is just a convoluted way of saying XOR. You don't need to implement any kind of complicated summation operation. Just perform a bitwise-exclusive OR.
See also https://en.wikipedia.org/wiki/Exclusive_or#Computer_science
$endgroup$
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
$begingroup$
The sum of two words with carries suppressed is just a convoluted way of saying XOR. You don't need to implement any kind of complicated summation operation. Just perform a bitwise-exclusive OR.
See also https://en.wikipedia.org/wiki/Exclusive_or#Computer_science
$endgroup$
The sum of two words with carries suppressed is just a convoluted way of saying XOR. You don't need to implement any kind of complicated summation operation. Just perform a bitwise-exclusive OR.
See also https://en.wikipedia.org/wiki/Exclusive_or#Computer_science
edited 6 mins ago
answered 3 hours ago
forestforest
4,2161540
4,2161540
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
1
1
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
Again, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
$begingroup$
That's right, thank you.
$endgroup$
– whole_lotta_coins
3 hours ago
add a comment |
whole_lotta_coins is a new contributor. Be nice, and check out our Code of Conduct.
whole_lotta_coins is a new contributor. Be nice, and check out our Code of Conduct.
whole_lotta_coins is a new contributor. Be nice, and check out our Code of Conduct.
whole_lotta_coins 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%2f67635%2fsalsa20-implementation-sum-of-2-words-with-carries-suppressed%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
$begingroup$
I knew it! Thank you.
$endgroup$
– whole_lotta_coins
3 hours ago