exa/codecrypt
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

man page: small clarification

Browse source
This commit is contained in:
Mirek Kratochvil 2013-09-12 11:59:32 +02:00
parent 3ca398b760
commit 7e32564119
1 changed files with 3 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
man/ccr.1
View file

@ -229,8 +229,9 @@ unnecessary. Note that using stronger algorithm variants does not come with any
serious performance drawback. serious performance drawback.
For comparison, 2^128 security level is very roughly equivalent to that of For comparison, 2^128 security level is very roughly equivalent to that of
classical RSA with 3072bit modulus (which is reported to provide 2^112 attack classical RSA with 3072bit modulus (which is, accordingly to the best results
complexity). available in June 2013 for general public, reported to provide roughly 2^112
attack complexity).
All algorithms are believed to be intractable by quantum computers, except for All algorithms are believed to be intractable by quantum computers, except for
the generic case of Grover search which (in a very idealized case and very the generic case of Grover search which (in a very idealized case and very