diff options
| author | Benjamin Peterson <benjamin@python.org> | 2014-05-26 22:48:12 (GMT) |
|---|---|---|
| committer | Benjamin Peterson <benjamin@python.org> | 2014-05-26 22:48:12 (GMT) |
| commit | 5e2c4d2de0c81e6a2d1ad8d3762733f65fb911af (patch) | |
| tree | db583f88b42ad5cb53da1840733dc4b4ff560272 | |
| parent | f9ea5f39d8eb3ab2082d0bd46778c34e51742e56 (diff) | |
| download | cpython-5e2c4d2de0c81e6a2d1ad8d3762733f65fb911af.zip cpython-5e2c4d2de0c81e6a2d1ad8d3762733f65fb911af.tar.gz cpython-5e2c4d2de0c81e6a2d1ad8d3762733f65fb911af.tar.bz2 | |
grammar and sentence flow fix
| -rw-r--r-- | Doc/library/hashlib.rst | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/Doc/library/hashlib.rst b/Doc/library/hashlib.rst index 39024af..e0a877a 100644 --- a/Doc/library/hashlib.rst +++ b/Doc/library/hashlib.rst @@ -197,8 +197,7 @@ include a `salt <https://en.wikipedia.org/wiki/Salt_%28cryptography%29>`_. a proper source, e.g. :func:`os.urandom`. The number of *rounds* should be chosen based on the hash algorithm and - computing power. As of 2013 a value of at least 100,000 rounds of SHA-256 - have been suggested. + computing power. As of 2013, at least 100,000 rounds of SHA-256 is suggested. *dklen* is the length of the derived key. If *dklen* is ``None`` then the digest size of the hash algorithm *name* is used, e.g. 64 for SHA-512. |