Theodore H. Smith wrote: > Why do you even need this code? > > It runs fast, but... what does it run fast for? I mean, what does it > DO, basically? >
Allows us to handle 1024 byte primes and perform very large exponentiation - i.e.: 2**1024**LargePrime very quickly. This is used as part of an extreme, asymmetric Diffie-Hellman authentication mechanism. > Anyhow, just an idea... but what about turning it into a class? > We started there. Even by manually unrolling the loops, we face a 40 second calculation with all #pragma optimizations. The same basic function in Python takes 14ms and our C code takes 4ms. Since I finally found the culprit last night, I'm sending a summary follow-up in a separate email that should respond to most of your remaining notes. Tim _______________________________________________ Unsubscribe or switch delivery mode: <http://www.realsoftware.com/support/listmanager/> Search the archives: <http://support.realsoftware.com/listarchives/lists.html>
