diff options
| author | J08nY | 2019-03-15 09:34:46 +0100 |
|---|---|---|
| committer | J08nY | 2019-03-15 09:34:46 +0100 |
| commit | 21b7936fce4f41dafa9aa3032eff44de1a72b1da (patch) | |
| tree | b66a59a7f434dd21264a34a9e96663ab14a2d772 /docs | |
| parent | ff50f6d45ddb265e06fe275c1d4ad2cf1e4e5440 (diff) | |
| download | ECTester-21b7936fce4f41dafa9aa3032eff44de1a72b1da.tar.gz ECTester-21b7936fce4f41dafa9aa3032eff44de1a72b1da.tar.zst ECTester-21b7936fce4f41dafa9aa3032eff44de1a72b1da.zip | |
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/LIBS.md | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/docs/LIBS.md b/docs/LIBS.md index d41f98a..7cd8e3e 100644 --- a/docs/LIBS.md +++ b/docs/LIBS.md @@ -1,6 +1,6 @@ # Libraries with ECC support -Popular libraries with at least some ECC support: +Popular libraries with at least some ECC support, that ECTester does not yet support: - [NSS](https://hg.mozilla.org/projects/nss) - [mbedTLS](https://tls.mbed.org/) @@ -55,8 +55,11 @@ Libraries that ECTester can test. - Uses Lopez-Dahab (Montgomery) ladder, XZ coordinates (ec2_mont.c): Fast multiplication on elliptic curves over GF(2^m) without precomputation (Algorithm 2P) - Contains an implementation of IEEE P1363 algorithm A.10.3 using affine coordinates (ec2_aff.c) - Has some custom arithmetic for some of the NIST primes. - - [WolfCrypt](https://www.wolfssl.com) + - [WolfCrypt(WolfSSL)](https://www.wolfssl.com) - C + Java + - Prime field curves only. + - Jacobian coordinates: + - Uses sliding window scalar multiplication, (discards `b` parameter of curve), but validates points. - [OpenSSL](https://www.openssl.org/) - C - For prime field curves: |