in reply to (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?)
in thread modular exponentiation with arbitrary precision binary numbers (did I say RSA?)

Let's see... Can you add binary strings? Multiply them? Modulo them? ... What can you do with them? Oh, I know, AND and XOR and NOT... funny, I don't remember using any of those in my code... Oh well... Ok, so maybe you could rewrite badd and bsub to do those...
  • Comment on Re: (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?)

Replies are listed 'Best First'.
(tye)Re2: modular exponentiation with arbitrary precision binary numbers (did I say RSA?)
by tye (Sage) on Dec 01, 2000 at 01:52 UTC

    Sorry, I meant "bitwise logical operations" but wrote "binary operations". And rewriting badd, bsub, and bmod to use these and work with bits instead of working with the characters '0' and '1' is all that I was talking about.

            - tye (but my friends call me "Tye")
[reply]

In Section Cool Uses for Perl