I've seen pseudocode of this form in the Montgomery multiplication related theses: $(C, S) := a[j]*b[0]+C$.

What's the meaning of "$(C, S):=$", or what is the real code that was converted from this pseudocode like?


I believe that the meaning is "compute the $2n$-bit value $a[j]*b[0] + C$, and then assign the top $n$ bits to $C$ and the bottom $n$ bits into $S$

  • $\begingroup$ @user3042720: if that answers the question, could you accept it (and possibly upvote it)? Thanks! $\endgroup$
    – poncho
    Jul 3 '15 at 20:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.