Greetings, guys. I thought you might be interested in this little ECDH-based public key encryption program that I wrote. Primarily this is an experiment in how simple and small this stuff can be. It probably contains the simplest public C implementation of usably efficient elliptic curve point scalar multiplication, and thus might be useful in learning practical ECC. In particular, Curve25519. For symmetric stuff, I use EnRUPT in the sponge construction. XXTEA could've been alternatively used (with increased rounds, of course), but it does not appear to provide as much resistance to attacks per processing time in this context, and is slightly more complex. For EnRUPT, I use twice the standard number of rounds. I use a custom KDF. I intend to write about this manner of constructing KDFs later. The goal is to cause a high area*time cost for massively parallel brute force via ASIC, similar to scrypt. That's about it. More information here: http://cipherdev.org/dhbitty.html -- yarrkov -- http://cipherdev.org/ _______________________________________________ cryptography mailing list cryptography@randombit.net http://lists.randombit.net/mailman/listinfo/cryptography ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://www.ativel.com http://postbiota.org 8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE