| Commit message (Collapse) | Author | Files | Lines |
|---|
|
This checks for a collection of prime order groups (secp, Brainpool, FRP)
the curve parameters are corrct. The collection is a superset of our
built-in curves, so we get one more validation for exxentially free.
|
|
Since the wycheproof tests were written in Java, they inherited some of
that language's weirdnesses. For example, the hex representation may have
odd length, is 2-complement and needs zero-padding if the top bit of a
nibble is set, similar to ASN.1 integers.
This is needed for correctly decoding the Primality test cases, which
worked nicely in v0 but no longer for v1. Convert the Primality test
to use this.
|
|
There's more work needed here since some of the tests are designed to
test the signing side of things, where we only verify. To be dealt with
later.
|
|
This excludes the bitcoin tests since our ECDSA_verify() doesn't have the
logic to enforce s < order / 2 to avoid the well-known malleability issue
with secp256k1 that (r, s) is valid if and only if (r, order - s) is valid.
Moreover, add a workaround for overly picky P1363 tests where only
correctly padded P1363 signatures are accepted. As the test authors say
"To our knowledge no standard (i.e., IEEE P1363 or RFC 7515) requires any
explicit checks of the signature size during signature verification."
In fact, the problem really is in the test code, not in libcrypto and
is a bit annoying to fix in a non-silly way.
|
|
|
|
|
|
|
|
|
|
eddsa_test.json is now ed25519_test.json and again key* was renamed to
PublicKey*.
|
|
key* are now called PublicKey*, so change teh json tags accordingly.
|
|
|
|
|
|
This is straightforward since the schema did not change. This adds
coverage for HMAC-SHA512/224 and HMAC-SHA512/256.
|
|
|
|
The version is passed to the test runner, so it can unmarshal the v0
and v1 JSON as appropriate later on.
|
|
|
|
In https://github.com/C2SP/wycheproof/pull/169, upstream removed the
testvector/ path, thereby creating the need to migrate if we want to
benefit from future changes and tests. While this has been around for
a very long time and generally provided more and better coverage, there
never was sufficient motivation to do so.
As a first step, change use of the testVectorPath constant to use of
a path variable so we can switch the tests one by one by appending _v1
when appropriate.
|
|
The old assembly bn_sqr_words() does not actually square words in the
bignum sense. These will have to be renamed (once I come up with a name
for whatever it actually does) before we can roll forward again.
Found the hard way by Janne Johansson.
|
|
|
|
Use bn_mul_words() and bn_montgomery_reduce_words(), rather than using
bn_montgomery_multiply_words(). This provides better performance on
architectures that have assembly optimised bn_mul_words(), such as amd64.
|
|
|
|
Use bn_sqr_words() and bn_montgomery_reduce_words(), rather than using
bn_montgomery_multiply_words(). This provides better performance on
architectures that have assembly optimised bn_sqr_words(), such as amd64.
ok tb@
|
|
This uses s2n-bignum's bignum_mul() and provides significant performance
gains for a range of multiplication sizes.
|
|
(for our purposes).
|
|
Not installed for nearly a decade since it only "documents" internal
functions and structs and the internal function doco gets more out of
sync with reality with every (much needed) pass over bn/
|
|
|
|
This was missed in the previous commit.
|
|
Most bn_.*_words() functions operate on two word arrays, however
bn_mul_words() and bn_mul_add_words() operate on one word array and
multiply by a single word. Rename these to bn_mulw_words() and
bn_mulw_add_words() to reflect this, following naming scheme that we use
for primitives.
This frees up bn_mul_words() to actually be used for multiplying two word
arrays. Rename bn_mul_normal() to bn_mul_words(), which will then become
one of the possible assembly integration points.
ok tb@
|
|
Rework some of the squaring code so that it calls bn_sqr_words() and use
this as the integration point for assembly. Convert bn_sqr_normal() to
bn_sqr_words(), which is then used on architectures that do not provide
their own version.
This means that we resume using the assembly version of bn_sqr_words() on
i386, mips64 and powerpc, which can provide considerable performance gains.
ok tb@
|
|
The code supporting this toggle has long been removed from all the forks.
discussed with jsing
|
|
|
|
|
|
|
|
I have effectively rewritten the entirety of this file end of 2024.
This isn't code I'm particularly proud of, but it's much better than
it was before (it's not as if that involved any sort of challenge...)
requested by/ok jsing
|
|
|
|
|
|
After drilling through many layers of fossilized turds from a
long-forgotten millenium, jsing and I finally found oil^Wa
machine-independent version of opensslconf.h.
Remove the no longer needed versions in arch/*/ and move one copy
to the top level. Add an RCS tag and place the remaining garbage
in the public domain.
ok jsing
|
|
|
|
|
|
|
|
|
|
Rides the libcrypto bump from a couple days ago
|
|
|
|
rides the libcrypto bump
|
|
|
|
|
|
This includes interfaces for public and private keys for ML-KEM 768
and 1024. Marshalling and parsing of public keys and parsing of the
wasteful NIST format of private keys (marshalling this private key
format is deliberately omitted from the public API). Decapsulation
and encapsulation of shared secrets.
This will soon be used to implement the X25519MLKEM768 hybrid key
agreement in libssl.
ok beck jsing
|
|
I was overeager to remove those a while back. This was dumb because
this is about a basic ASN.1 type. The Gentoo maintainers found that
tpm2-tools uses templated ASN.1 involving them.
Fixes https://github.com/libressl/portable/issues/1178
ok beck jsing
|
|
Removes another patch in portable
|
|
This allows us to get rid of an ugly patch in portable.
ok jsing
|
