AP®︎ Cybersecurity: Topic 5.4 Flashcards

Cryptography that uses mathematically related public and private keys, allowing secure communication without a prearranged shared secret

Two equal-length binary keys generated together as mathematical inverses, with either key’s operation reversible only by its partner

The published member of a key pair; a sender uses the intended receiver’s public key to encrypt confidential data

The secret member of a key pair; its owner securely stores it and uses it to decrypt data encrypted with the matching public key

Exposure, theft, sharing, corruption, or loss of a private key requiring the old key pair to be retired and replaced

The number of bits in a key; within the same algorithm, longer keys generally improve security but require more processing

An n-bit binary key has 2^n possible values, and each additional bit doubles the keyspace

An n-bit key requires 2^n / 2 = 2^(n−1) guesses on average when keys are tried without repetition

Key lengths can be directly compared only within the same cryptographic algorithm, not across algorithms such as RSA and AES.

A common asymmetric algorithm based on mathematical relationships involving large numbers, used for encryption, signatures, and certificates

Asymmetric cryptography based on mathematical relationships involving elliptic curves, supporting key pairs, signatures, and certificates

An asymmetric application in which the owner uses a private key and others use the matching public key to verify origin and integrity

An asymmetric-cryptography application that associates an identity with a public key

The receiver generates a key pair, protects the private key, and publishes the public key; the sender encrypts with the receiver’s public key, and the receiver decrypts with the matching private key