key length
The size of a cryptographic key in bits, which sets how many possible keys an attacker would have to try.
In more detail
Each extra bit doubles the work of a brute-force search, but lengths are only comparable within one kind of algorithm. A 128-bit AES key is already beyond brute force and 256 bits adds margin, while RSA needs at least 2048 bits, with NIST expecting 3072 bits after 2030, and elliptic curves reach similar strength with 256-bit keys. Short keys, such as 1024-bit RSA, should be replaced.
Examples
openssl genpkey -algorithm RSA -pkeyopt rsa_keygen_bits:3072 -out rsa.keyPublic-Key: (1024 bit)Related terms
- brute force attack — Trying many passwords against one account until one works.
- RSA — A widely used public-key algorithm, named after its inventors Rivest, Shamir and Adleman, used for digital signatures and for encrypting small secrets such as keys.
- ECC — Elliptic curve cryptography: public-key cryptography built on the maths of elliptic curves, giving the same strength as RSA with far smaller keys.
- AES — The Advanced Encryption Standard: the widely used symmetric encryption algorithm standardised by NIST.
Taught in
- Symmetric Encryption: AES-GCM & ChaCha20 — Cybersecurity Fundamentals, GRC & Cryptography
- Asymmetric Cryptography: RSA, ECC & Diffie-Hellman — Cybersecurity Fundamentals, GRC & Cryptography
- Security Capstone Review & Certification — Cybersecurity Fundamentals, GRC & Cryptography