Files
OpenCellular/chip/g/dcrypto
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
..
2017-05-15 20:51:37 -07:00
2017-05-15 20:51:37 -07:00
2017-10-06 00:21:29 -07:00
2017-07-06 21:53:35 +00:00
2017-07-06 21:53:35 +00:00
2017-10-06 00:21:29 -07:00
2016-12-22 00:40:29 +00:00
2016-12-22 00:40:29 +00:00
2017-07-06 21:53:35 +00:00
2017-05-29 09:03:54 -07:00
2016-12-12 23:28:20 -08:00
2016-12-12 23:28:20 -08:00
2017-08-04 18:08:16 -07:00