Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Algorithm

PBKDF2

Cryptographic Algorithm

PBKDF2, or Password-Based Key Derivation Function 2, is a key derivation function with a sliding computational cost designed to reduce vulnerability to brute-force attacks. It is part of RSA Laboratories' Public-Key Cryptography Standards series as PKCS number 5 version 2.0, also published as Internet Engineering Task Force RFC 2898, and it superseded the earlier PBKDF1, which could only produce derived keys up to 160 bits long.

Facts
Time Complexity
Time Complexity (category)
Linear Time -- O(n) 1
Connections

In Field

Cryptography, Fields
Source PBKDF2 (Wikipedia)
Sources
1. PBKDF2 (Wikipedia)
  • Wikipedia infobox: time complexity linear
    linear
  • In Group: Key Derivation Function, Lead paragraph: 'PBKDF1 and PBKDF2 ... are key derivation functions with a sliding computational cost'.
  • In Field: Cryptography, Lead sentence
    PBKDF1 and PBKDF2 (Password-Based Key Derivation Function 1 and 2) are key derivation functions with a sliding computational cost, used to reduce vulnerability to brute-force attacks.
View the Source
Wikidata: PBKDF2
Wikidata Q3952834, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.