openbsd/src/lib/libcrypto/bn/bn_mod_words.c, branch OPENBSD_7_9A mirror of https://github.com/libressl/openbsd.git
https://git.lua4.win/openbsd/atom?h=OPENBSD_7_92025-09-07T05:21:29+00:00Re-enable bn_sqr_words() assembly.2025-09-07T05:21:29+00:00jsing2025-09-07T05:21:29+00:00urn:sha1:9283c4361ce1f1a39a1f03c588c3d1a3da64025e
This is now only on amd64.
Disable assembly bn_sqr_words() again for now.2025-09-02T14:18:38+00:00jsing2025-09-02T14:18:38+00:00urn:sha1:99f066b0e074e44bab8174651b96c62ac333cc64
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() from bn_mod_mul_words().2025-09-01T15:35:25+00:00jsing2025-09-01T15:35:25+00:00urn:sha1:99d47c1078643352842f47b6330086d9affefb59
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() from bn_mod_sqr_words().2025-09-01T15:18:55+00:00jsing2025-09-01T15:18:55+00:00urn:sha1:a71d96fc5f06e3d4eaad85e2958a525f4f6fd26e
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@
Speed up bn_{mod,sqr}_mul_words() for specific inputs.2025-08-05T15:15:54+00:00jsing2025-08-05T15:15:54+00:00urn:sha1:a5c70cbde2039249ddc7543b92342954595ec2a5
Use bn_{mul,sqr}_comba{4,6,8}() and bn_montgomery_reduce_words() for
specific input sizes. This is significantly faster than using
bn_montgomery_multiply_words().
ok tb@
Provide bn_mod_sqr_words() and call it from ec_field_element_sqr().2025-08-02T16:20:00+00:00jsing2025-08-02T16:20:00+00:00urn:sha1:39d33c1bb185014e05def87e04f21103d92dc455
For now this still calls bn_montgomery_multiply_words(), however it can
be optimised further in the future.
Provide bn_mod_{add,sub,mul}_words().2025-05-25T04:58:32+00:00jsing2025-05-25T04:58:32+00:00urn:sha1:48472c192c88669e44bdba626a93217f709ca4d4
These implement constant time modular addition, subtraction and
multiplication in the Montegomery domain.
ok tb@