Files
OpenCellular/chip/g
Marius Schilder 1e855ebfcf g: speed up prime generation by ~40% (1024 bit).
We were using bn_modexp() to perform a simple modular square.
A bn_modexp_word() does this faster.

BRANCH=none
BUG=b:68167013
TEST=generate 128 primes from prng seed and verify they're same as before; tcg_test passes

Change-Id: I411a7d3fe2d68f93dc40bf74b941a637f9aa20ed
Reviewed-on: https://chromium-review.googlesource.com/778057
Commit-Ready: Marius Schilder <mschilder@chromium.org>
Tested-by: Marius Schilder <mschilder@chromium.org>
Reviewed-by: Marius Schilder <mschilder@chromium.org>
Reviewed-by: Nagendra Modadugu <ngm@google.com>
Reviewed-by: Vadim Bendebury <vbendeb@chromium.org>
2017-11-21 18:53:36 -08:00
..
2016-04-29 16:07:13 -07:00
2017-05-16 13:37:03 -07:00
2016-02-01 21:17:22 +00:00
2017-06-16 17:24:28 -07:00
2016-11-04 18:31:44 -07:00
2017-05-12 03:25:39 -07:00
2017-09-27 00:51:09 +00:00
2016-07-13 19:09:19 -07:00
2017-08-01 13:01:41 -07:00
2017-08-01 13:01:41 -07:00
2017-10-18 22:48:41 +00:00
2017-06-16 17:24:28 -07:00
2017-10-06 00:21:29 -07:00
2015-04-02 20:27:46 +00:00
2016-10-22 00:01:02 +00:00
2017-10-06 00:21:29 -07:00
2017-10-06 00:21:29 -07:00
2017-03-16 11:25:50 -07:00
2017-09-22 10:18:50 -07:00