mirror of
https://github.com/biergaizi/codecrypt
synced 2024-06-27 01:08:15 +00:00
man page: small clarification
This commit is contained in:
parent
3ca398b760
commit
7e32564119
@ -229,8 +229,9 @@ unnecessary. Note that using stronger algorithm variants does not come with any
|
||||
serious performance drawback.
|
||||
|
||||
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
|
||||
complexity).
|
||||
classical RSA with 3072bit modulus (which is, accordingly to the best results
|
||||
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
|
||||
the generic case of Grover search which (in a very idealized case and very
|
||||
|
Loading…
Reference in New Issue
Block a user