On 3/5/2011 12:00 PM, Chad Nelson wrote:
On Fri, 04 Mar 2011 10:10:36 -0600 Rene Rivera<grafikrobot@gmail.com> wrote:
Unfortunately I don't have time to do a review of your library (even a quick one). But I do have one question... In my general code library I have an implementation of a one-way-accumulator based on the facilities provided by the Botan library. It's an algorithmically efficient implementation using Barrett reducers for modulo exponentiation with small bases and large exponents. My question is: How would I go about implementing the equivalent in your library?
NOTE: I can post my code if need be to make this a clearer question.
I'm afraid you'll have to, as I can't tell exactly what it does from your description. I'll be happy to try to port it to XInt.
OK, attached is the source code for my class that implements the algo. Note, it's not open-source code by any means. So other reading take that into consideration. PS. Also excuse the code itself.. It's really old and doesn't follow any of my more recent library-centric programming practices. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org (msn) - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail