On 10/3/12 7:24 AM, kcrisman wrote:
On Wednesday, October 3, 2012 3:07:48 AM UTC-4, Minh Nguyen wrote:
Hi folks,
Two pieces of good news today:
* The new SHA-3 candidate has been announced following a five-year
period of intense scrutiny.
* The winner is Keccak, whose authors used Sage in the design of the
algorithm.
Nice! Thanks for the update. PolyBoRi makes a very large appearance as
well.
Not so nice:
"The inverse of 1 + x + x4z can be computed with a variant of the
extended Euclidian algorithm for polynomials in multiple variables. At
the time of writing this was unfortunately not supported by SAGE."
The document was written on January 14, 2011 (at least, version 3 was
written then; who knows when that sentence was written). Do we support
it now?
Thanks,
Jason
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
Visit this group at http://groups.google.com/group/sage-devel?hl=en.
