|
![](/i/fill.gif) |
>>>> Binary shifts are multiplication and division as well. :P
>>> What you want is binary rotations. ;-)
>> That depends on whether the bits actually get rotated. From my
>> recollection of x86 assembly, it's a shift, not a rotation. :)
>>
>> Jim
>
> My recollection, of course, has changed now that I re-read this, I
> remember ROR and ROL operators, which do in fact rotate. I just remember
> using SHL and SHR more frequently.
Whether your processor supports it or not, binary rotations exist. You
can implement them the hard way if you must. I've seen a few block
ciphers that use 'em too...
--
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*
Post a reply to this message
|
![](/i/fill.gif) |