Home
New release of MIRACL
5.4.2 New pairing implementation at higher security level (ake18kssx.cpp) - Support for .NET managed code.
5.4.1 New pairing implementations - Improved extension field towerings
5.4 Edwards Curves now supported - see edwards.txt. Full support for Win64 applications (64-bit windows)
Some minor improvements to pairings. Some new pairings supported.
5.3.3 Support for Joint Sparse Form, and for elliptic curves over quadratic extensions. Faster, smaller Jacobi symbol code. Implementation of R-ate pairing - see pairings.txt. Automatic ROM generators for ECC - see romaker.c and romaker2.c
5.3.2 Support for Pseudo Mersenne Prime moduli of the form 2^n-c, where n is a multiple of the word length, and c is a small constant. See ecdhp32.c for an example of use. Improved support for ARM processor.
5.3.1 Improved support for x86-64. See amd64.txt. A cryptographic pairing on a BN curve at AES-128 security now takes 13.5 ms on a 1.66GHz Centrino Duo
5.3
New support for 8-bit MIRACL, and for tiny architectures like Atmel AVR ATmega128. This Atmel device is commonly used in Wireless Sensor Networks. See ecdh2m8.c and ecdhp8.c and avr.mcs. A 160-bit Elliptic curve point multiplication in 2.5 seconds at 4MHz! Also support for the TI msp430 16-bit processor - see msp430.mcs and gccmsp430.mcs
New options to reduce ROM/RAM requirements for small architectures.
5.2.2
OpenMP supported for multi-core programming - see threadmp.cpp. New small, fast ECDH example programs ecdh2m.c ecdhp.c (for 32-bit processors) and ecdh2m16.c (for 16-bit processors). This last is ideal for low powered wireless sensor networks.
5.2.1
The 64-bit PowerPC (as used for example in the IBM/Sony Cell processor) is now supported via the MCS macro mechanism - see the file gccppc.mcs. For example "mex 3 gccppc mrcomba" will automaticly create an optimal mrcomba.c module for fast 192-bit (3*64) arithmetic - ideal for elliptic curve crypto on the NIST P-192 elliptic curve.
Next page: Benchmarks