| info.txt |
|
188 |
| pgp_s2k.cpp |
max_memory_usage_mb |
5068 |
| pgp_s2k.h |
OpenPGP's S2K
See RFC 4880 sections 3.7.1.1, 3.7.1.2, and 3.7.1.3
If the salt is empty and iterations == 1, "simple" S2K is used
If the salt is non-empty and iterations == 1, "salted" S2K is used
If the salt is non-empty and iterations > 1, "iterated" S2K is used
Due to complexities of the PGP S2K algorithm, time-based derivation
is not supported. So if iterations == 0 and msec.count() > 0, an
exception is thrown. In the future this may be supported, in which
case "iterated" S2K will be used and the number of iterations
performed is returned.
Note that unlike PBKDF2, OpenPGP S2K's "iterations" are defined as
the number of bytes hashed.
|
4367 |
| rfc4880.cpp |
PGP stores the iteration count as a single byte
Thus it can only actually take on one of 256 values, based on the
formula in RFC 4880 section 3.6.1.3
|
3464 |
| rfc4880.h |
Helpers for encoding PGP S2K values (see RFC 4880)
|
800 |