Very ambitious suggestions! In the meantime I'll try just implementing one case, make sure it works both for multiplicative groups of finite fields and elliptic curve groups, and let other people take it from there.
Otherwise I'll get distracted from the (nearly ready) patch for #1121 and #1130. You'll love it. John On 13/02/2008, William Stein <[EMAIL PROTECTED]> wrote: > > On Feb 13, 2008 2:22 PM, David Harvey <[EMAIL PROTECTED]> wrote: > > > > > > On Feb 13, 2008, at 5:09 PM, Nick Alexander wrote: > > > > > John also needs identity and inverses, which requires passing in > > > three or functions. Or, more likely a struct, which in an OO > > > language, I call an object. > > > > > > To me, that means you're writing a special purpose "abstract group" > > > wrapper for discrete logs, which is fine. But I believe the heavier > > > > This would be great to have in sage. I wanted to work on something > > like this in collaboration with Andrew Sutherland a few months back, > > but that whole annoying thesis thing got in the way. Our idea was to > > have the underlying abstract group algorithms (like computing > > discrete logs, exponents of groups, orders of groups, group > > structures etc) written in C++ with templates. Andrew has had a lot > > of experience with this. One instantiation would be a black box using > > C function pointers, which we could then plug into a cython class to > > perform the arithmetic. > > > > david > > +1 This sounds like an extremely good but concrete test situation > to think through. > > William > > > > -- John Cremona --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
