openbsd/src/lib/libcrypto/bn/bn_mul.c, branch OPENBSD_7_9_BASEA mirror of https://github.com/libressl/openbsd.git
https://git.lua4.win/openbsd/atom?h=OPENBSD_7_9_BASE2025-09-01T15:39:59+00:00Add const here as well...2025-09-01T15:39:59+00:00jsing2025-09-01T15:39:59+00:00urn:sha1:8262857db881f41bd13636dcc49f7f4b28ba9e08Constify bn_mul_words().2025-09-01T15:33:23+00:00jsing2025-09-01T15:33:23+00:00urn:sha1:edd4db8b24106490f82c1a694d4e2b35afe9c6cbRename bn_mul_words()/bn_mul_add_words().2025-08-30T07:54:27+00:00jsing2025-08-30T07:54:27+00:00urn:sha1:694b88dc8ad458db9997e90128806a423fec09db
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@
Add special handling for multiplication and squaring of BNs with six words.2025-08-14T15:15:04+00:00jsing2025-08-14T15:15:04+00:00urn:sha1:6dbe806d026a9b65d3decbcd23fb9b70559bf259
In these cases make use of bn_mul_comba6() or bn_sqr_comba6(), which are
faster than the normal path.
ok tb@
Provide bn_mul_comba6().2025-08-05T15:06:13+00:00jsing2025-08-05T15:06:13+00:00urn:sha1:871e14b0960d825feebc1fc7d19f6d3c961cc2d1
This allows for fast multiplication of two 6 word arrays.
ok tb@
Mark the inputs to bn_mul_comba{4,8}() as const.2025-08-05T15:01:13+00:00jsing2025-08-05T15:01:13+00:00urn:sha1:dc28959092efae771ef92dcf98fcb3ba4fce15cb
This makes it consistent with bn_sqr_comba{4,8}() and simplifies an
upcoming change.
ok tb@
Avoid signed overflow in BN_mul()2025-08-03T10:32:04+00:00tb2025-08-03T10:32:04+00:00urn:sha1:b5992183ef86510bda13fd9674c1a55a9ea26f03
Reported by smatch via jsg.
ok beck jsing kenjiro
Hide symbols in bn2023-07-08T12:21:58+00:00beck2023-07-08T12:21:58+00:00urn:sha1:1dad5f352903aa46e83f0b1265298f7e1d4a9633
ok tb@
Provide and use various quad word primitives.2023-06-12T16:17:24+00:00jsing2023-06-12T16:17:24+00:00urn:sha1:e65682b76bcfaec43a218a52db723a341bec5b90
This includes bn_qwaddqw(), bn_qwsubqw(), bn_qwmulw_addw() and
bn_qwmulw_addqw_addw(). These can typically be optimised on architectures
that have a reasonable number of general purpose registers.
ok tb@
unifdef BN_RECURSION2023-04-19T10:51:22+00:00jsing2023-04-19T10:51:22+00:00urn:sha1:2fb6a5afb5b39fadad20a8acaf72324fd753942b
This removes a bunch of incomplete and scary code, which potentially leaks
secrets and is not constant time. A performance gain is achieved on arm64
for sizes that we care about, while a minimal decrease in performance is
noted for larger sizes on some other platforms.
While we will potentially reimplement Karatsuba (or Toom-Cook) at a later
date, it will be easier and safer to do it from a clean slate.
ok tb@