Hi Everyone, The main crypto functionality that I implemented concerns classical cryptography, for the purposes of teaching:
http://echidna.maths.usyd.edu.au/~kohel/tch/Crypto/ Hence most of the systems are breakable (using suitable classical cryptanalytic attacks). The cryptosystem class can be extended by adding subclasses for more serious RSA, ElGamal, and symmetric key systems. Modes of operation (for block ciphers) are yet to be implemented, but intended. Classes of hash functions would also be natural additions -- I'm happy to discuss the higher level structure for classes of ciphers and hashes. Many of the latter algorithms, and fast algorithms for RSA, ElGamal, and ECC have implementations in standard libraries, but as noted, scaled down "weak" versions would be useful for testing or demonstrating attacks. --David On May 29, 10:08 am, David Harvey <[EMAIL PROTECTED]> wrote: > On May 28, 2007, at 7:38 PM, Nick Alexander wrote: > > > > > "William Stein" <[EMAIL PROTECTED]> writes: > > >> SUMMARY: There is a huge amount of crypto-related functionality in > >> SAGE already, but it is "all over", and there are some exciting > >> and unique > >> cryptographic algorithms that could be implemented in SAGE that > >> aren't implemented now. > > > In addition, SAGE could really use arithmetic in Jacobians of > > hyperelliptic curves. If you are interested in computational > > algebraic geometry and cryptography, this would be a valuable > > contribution. > > I second this. Would be great to have a fast implementation. In > particular there are supposed to be very fast algorithms for genus 2, > and perhaps 3 too. > > david --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
