Update recommended PBKDF2HMAC iteration counts

Author: simonrob

docs/fernet.rst

@@ -238,7 +238,7 @@ password through a key derivation function such as
     ...     algorithm=hashes.SHA256(),
     ...     length=32,
     ...     salt=salt,
-    ...     iterations=1_000_000,
+    ...     iterations=1_200_000,
     ... )
     >>> key = base64.urlsafe_b64encode(kdf.derive(password))
     >>> f = Fernet(key)
@@ -252,7 +252,7 @@ In this scheme, the salt has to be stored in a retrievable location in order
 to derive the same key from the password in the future.
 
 The iteration count used should be adjusted to be as high as your server can
-tolerate. A good default is at least 1,000,000 iterations, which is what `Django
+tolerate. A good default is at least 1,200,000 iterations, which is what `Django
 recommends as of January 2025`_.
 
 Implementation

docs/hazmat/primitives/key-derivation-functions.rst

@@ -162,15 +162,15 @@ PBKDF2
         ...     algorithm=hashes.SHA256(),
         ...     length=32,
         ...     salt=salt,
-        ...     iterations=1_000_000,
+        ...     iterations=1_200_000,
         ... )
         >>> key = kdf.derive(b"my great password")
         >>> # verify
         >>> kdf = PBKDF2HMAC(
         ...     algorithm=hashes.SHA256(),
         ...     length=32,
         ...     salt=salt,
-        ...     iterations=1_000_000,
+        ...     iterations=1_200_000,
         ... )
         >>> kdf.verify(b"my great password", key)