mirror of
https://github.com/Telecominfraproject/OpenCellular.git
synced 2025-12-30 18:41:11 +00:00
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>