openslx-ng/ipxe.git/src/tests, branch openslx

[crypto] Allow for zero-length big integer literals

2025-12-29T14:01:46+00:00

Ensure that zero-length big integer literals are treated as containing a zero value. Avoid tests on every big integer arithmetic operation by ensuring that bigint_required_size() always returns a non-zero value: the zero-length tests can therefore be restricted to only bigint_init() and bigint_done(). Signed-off-by: Michael Brown

[test] Update big integer tests to use okx()

2025-12-29T13:18:10+00:00

Signed-off-by: Michael Brown

[test] Add test cases for X.509 certificates with ECDSA signatures

2025-12-19T15:26:29+00:00

Signed-off-by: Michael Brown

[test] Ensure OID-identified algorithms are present for X.509 tests

2025-12-19T14:24:27+00:00

The algorithms required for the X.509 tests are accessed indirectly via their OID-identified algorithms, rather than directly via symbols. Ensure that the required OID-identified algorithm definitions are included regardless of the configuration in config/crypto.h. Signed-off-by: Michael Brown

[crypto] Add support for ECDSA signatures

2025-12-19T10:06:50+00:00

Signed-off-by: Michael Brown

[test] Test verification of constructed signature

2025-12-18T23:10:57+00:00

Some signature schemes (such as ECDSA) allow for non-deterministic signatures. Provide more information in test results by performing verification of the constructed signature even when it does not match the expected test case result: this allows us to distinguish between a bug that is generating invalid signatures and a bug that is generating valid but non-canonical signatures. Signed-off-by: Michael Brown

[crypto] Allow for an explicit representation of point at infinity

2025-12-18T15:47:29+00:00

ECDSA requires the ability to add two arbitrary curve points, either of which may legitimately be the point at infinity. Update the API so that curves must choose an explicit affine representation for the point at infinity, and provide a method to test for this representation. Multiplication and addition will now allow this representation to be provided as an input, and will not fail if the result is the point at infinity. Callers must explicitly check for the point at infinity where needed (e.g. after computing the ECDHE shared secret curve point). Signed-off-by: Michael Brown

[test] Test signature verification independently of signing

2025-12-17T20:38:21+00:00

Copy and modify the signature defined within the test case for verification tests, rather than relying on the modifiable signature constructed by the signing portion of the same test. Signed-off-by: Michael Brown

[crypto] Allow for addition of arbitrary Weierstrass curve points

2025-12-08T14:24:24+00:00

ECDSA verification requires the ability to add two arbitrary curve points (as well as the ability to multiply a curve point by a scalar). Add an elliptic curve method to perform arbitrary point addition. Pass in curve points as affine coordinates: this will require some redundant conversions between affine coorfinates and the internal representation as projective coordinates in Montgomery form, but keeps the API as simple as possible. Since we do not expect to perform a high volume of ECDSA signature verifications, these redundant calculations are an acceptable cost for keeping the code simple. Signed-off-by: Michael Brown

[crypto] Expose the (prime) group order as an elliptic curve property

2025-12-05T15:10:22+00:00

ECDSA requires knowledge of the group order of the base point, and is defined only for curves with a prime group order (e.g. the NIST curves). Add the group order as an explicit property of an elliptic curve, and add tests to verify that the order is correct. Signed-off-by: Michael Brown