summaryrefslogtreecommitdiff
path: root/registry
diff options
context:
space:
mode:
authorMichael Stahl <mstahl@redhat.com>2016-11-09 18:42:46 +0100
committerMichael Stahl <mstahl@redhat.com>2016-11-09 19:07:20 +0100
commit25205d5b29d0aade0ebd7c6405a91995d02a3a7c (patch)
treeb59667a739670467f2a8a4ad524cac8640fdb100 /registry
parent2a5bb08a2c84470a7a33547ee478d3c26f7ae159 (diff)
package: ODF: bump PBKDF2 iteration counts
Given recent elections we need to build a higher wall to keep the government out of our documents, and we will make the government pay for it. These iteration counts were considered appropriate a decade ago. http://security.stackexchange.com/questions/3959/recommended-of-iterations-when-using-pkbdf2-sha256 We get similar numbers on SandyBridge-E desktop and Haswell i7-4600U laptop: * with 10k iterations ~20 msec per derivation * with 100k iterations ~195 msec per derivation * with 150k iterations ~290 msec per derivation We can't go too high though because in ODF every package stream gets its own derived key with a different salt, so a document with embedded images may need a lot of these. Change-Id: I6894e71ed399f8c340eff97a9191c8d8419789a6
Diffstat (limited to 'registry')
0 files changed, 0 insertions, 0 deletions