@@ -185,22 +185,23 @@ brute-force attacks. A good password hashing function must be tunable, slow, and
185185include a `salt <https://en.wikipedia.org/wiki/Salt_%28cryptography%29 >`_.
186186
187187
188- .. function :: pbkdf2_hmac(name , password, salt, rounds , dklen=None)
188+ .. function :: pbkdf2_hmac(hash_name , password, salt, iterations , dklen=None)
189189
190190 The function provides PKCS#5 password-based key derivation function 2. It
191191 uses HMAC as pseudorandom function.
192192
193- The string *name * is the desired name of the hash digest algorithm for
193+ The string *hash_name * is the desired name of the hash digest algorithm for
194194 HMAC, e.g. 'sha1' or 'sha256'. *password * and *salt * are interpreted as
195195 buffers of bytes. Applications and libraries should limit *password * to
196- a sensible value (e.g. 1024). *salt * should be about 16 or more bytes from
196+ a sensible length (e.g. 1024). *salt * should be about 16 or more bytes from
197197 a proper source, e.g. :func: `os.urandom `.
198198
199- The number of *rounds * should be chosen based on the hash algorithm and
200- computing power. As of 2013, at least 100,000 rounds of SHA-256 is suggested.
199+ The number of *iterations * should be chosen based on the hash algorithm and
200+ computing power. As of 2013, at least 100,000 iterations of SHA-256 are
201+ suggested.
201202
202203 *dklen * is the length of the derived key. If *dklen * is ``None `` then the
203- digest size of the hash algorithm *name * is used, e.g. 64 for SHA-512.
204+ digest size of the hash algorithm *hash_name * is used, e.g. 64 for SHA-512.
204205
205206 >>> import hashlib, binascii
206207 >>> dk = hashlib.pbkdf2_hmac(' sha256' , b ' password' , b ' salt' , 100000 )
0 commit comments