> > * Tobias Eibach and Gunnar Völkel: Optimising Gröbner Bases on Bivium > > (used Sage to implement attack) > > * Burçin Eröcal: SCrypt: Using Symbolic Computation to Bridge the Gap > > Between Algebra and Cryptography (module for Sage) > > * Ralf-Philipp Weinmann and Johannes Buchmann: Distributed Memory > > Computation of Row-Reduced Echelon Forms over Finite Fields (benchmarked > > against Sage) * Yours truly and Carlos Cid: Algebraic Techniques in > > Differential Cryptanalysis (used Sage to implement attack) > > > > (... yes, I know that 3 out of 4 are Sage developers, but still ...) > > So is 2. Why isn't 1 a Sage developer? We want their code :-).
I meant: Three authors on that list of four entries are Sage developers. > By the way, what does "benchmarked against Sage" mean in RPW's talk? Ralf developed a parallel matrix reduction algorithm on distributed memory (!) and used Sage (LinBox and native implementation) to compare his timings. Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
