eden-emu/mbedtls
14
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Redo of PR#5345. Fixed spelling and typographical errors found by CodeSpell.

Browse source 
Signed-off-by: Shaun Case <warmsocks@gmail.com>
Signed-off-by: Dave Rodgman <dave.rodgman@arm.com>
This commit is contained in:
Shaun Case 2021-12-20 21:14:10 -08:00 • committed by Dave Rodgman
parent 5479f5321a
commit 8b0ecbccf4
78 changed files with 151 additions and 151 deletions
Download patch file Download diff file Expand all files Collapse all files

4
library/rsa.c
View file

@ -848,10 +848,10 @@ cleanup:
* the more bits of the key can be recovered. See [3].
*
* Collecting n collisions with m bit long blinding value requires 2^(m-m/n)
* observations on avarage.
* observations on average.
*
* For example with 28 byte blinding to achieve 2 collisions the adversary has
* to make 2^112 observations on avarage.
* to make 2^112 observations on average.
*
* (With the currently (as of 2017 April) known best algorithms breaking 2048
* bit RSA requires approximately as much time as trying out 2^112 random keys.