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")In reply to (tye)Re: modular exponentiation with arbitrary precision binary numbers (did I say RSA?)
by tye
in thread modular exponentiation with arbitrary precision binary numbers (did I say RSA?)
by jhanna
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |