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

Note that Perl supports binary operations on "arbitrary length" strings so this could be done using real bits instead of '0' and '1' chars. Of course, some logic would have to be reworked since you can't append one bit to a string.

- tye (but my friends call me "Tye")

Comment on (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?)

Replies are listed 'Best First'.
Re: (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?) by jhanna (Scribe) on Dec 01, 2000 at 01:30 UTC
Yes... But actually my target lanaguage for this is javascript. Javascript doesn't support arbitrary length binary operations. But with this little diddly one can potentially do browser based public key crypto without needing SSL, eg to transmit credit cards, who knows what else... j	[reply]
Re: (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?) by jhanna (Scribe) on Dec 01, 2000 at 01:38 UTC
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...	[reply]
(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]