sybrenstuvel / python-rsa / 310

92%

push

travis-ci

Fix #162: Blinding uses slow algorithm

Store blinding factor + its inverse, so that they can be reused & updated
on every blinding operation. This avoids expensive computations.

The reuse of the previous blinding factor is done via squaring (mod n), as
per section 9 of 'A Timing Attack against RSA with the Chinese Remainder
Theorem' by Werner Schindler, https://tls.mbed.org/public/WSchindler-RSA_Timing_Attack.pdf

23 of 23 new or added lines in 1 file covered. (100.0%)

739 of 807 relevant lines covered (91.57%)

2.75 hits per line