Add TlsUtils.encodeOpaque8 method
Merge branch 'master' of git.bouncycastle.org:bc-java
At least seed the random source with current time
Add prepend method
Avoid calling BigInteger.mod for small operations on prime fields
Performance improvements for Fp points:
- Replace multiplications by small constants with additions
- Implement 2P + Q optimization from paper by Ciet, Joye et. al.
Avoid final call to twice()
Use the new method twicePlus in left-to-right EC multiplications
Use ECCurve.fromBigInteger to construct field elements
Add warm-up rounds
Add secp384r1
Implement Fp optimisation of 3P calculation in new threeTimes() method
A couple extra simple test cases
Some extra quick checks for same object argument
Cheaper x3
Add implementation of Joye's double-add algorithm
Add Montgomery Ladder multiplier
Add Zeroless Signed Digit left-to-right multiplier
Speedup Fp field calculations when the prime has a small residue
relative to a power-of-2 (as is the case for many NIST curves).
Deprecate public constructors in favour of ECCurve.fromBigInteger
Make DoubleAddMultiplier the default, and use for Fp
Refactor calculateE method