Hi,

In message "Re: Speed Kata: pure-Ruby powmod"
    on 03/05/22, Clifford Heath <cjh_nospam / managesoft.com> writes:

|.... and then implement the powmod operation using one of the
|established (advanced!) methods, like the Chinese remainder
|theorem, and then recode the whole thing in assembler (which
|*does* buy a lot of speed).
|
|Or you could be sensible, and just import the appropriate code
|from OpenSSL/SSLeay, where Eric Young has already done all
|this, spending weeks of effort and beating the best commercial
|implementations. IIRC his licensing terms merely require
|acknowledgement.

Good news.  Contribution is welcome as always.  If someone is willing
to put it in bignum.c, I'm happy to merge it.

							matz.