【发布时间】:2017-05-20 07:49:40
【问题描述】:
A = A + S[0];
B = B + S[1];
for i = 1 to r do
A = ((A ⊕ B) <<< B) + S[2i];
B = ((B ⊕ A) <<< A) + S[2i + 1];
是RC5 encryption algorithm,这里的⊕和+有什么区别?
【问题讨论】:
标签: bit-manipulation bitwise-operators addition