PBKDF1 is a key derivation function, it's not designed to be slow (as is, for example, bcrypt)
No that's actually one of the purposes of a KDF:
http://tools.ietf.org/html/rfc2898#page-84.2 Iteration Count
An iteration count has traditionally served the purpose of increasing the cost of producing keys from a password, thereby also increasing the difficulty of attack. For the methods in this document, a minimum of 1000 iterations is recommended. This will increase the cost of exhaustive search for passwords significantly, without a noticeable impact in the cost of deriving individual keys.
Comments
PBKDF1 is a key derivation function, it's not designed to be slow (as is, for example, bcrypt)
No that's actually one of the purposes of a KDF:
http://tools.ietf.org/html/rfc2898#page-8 4.2 Iteration Count An iteration count has traditionally served the purpose of increasing the cost of producing keys from a password, thereby also increasing the difficulty of attack. For the methods in this document, a minimum of 1000 iterations is recommended. This will increase the cost of exhaustive search for passwords significantly, without a noticeable impact in the cost of deriving individual keys.