Flashcard Deck · 25 cards · Public

Melbourne COMP90043 - Cryptography and Security

Master the essentials of modern cryptography and computer security with this high-yield flashcard deck, covering encryption, authentication, hashing, PKI, and critical cyber threats for COMP90043.

Cards in this deck

(25 cards)

Preview terms and definitions before starting your study session.

#1
Term
What is Cryptography?
Definition
Cryptography is the practice and study of techniques for secure communication in the presence of adversarial behavior. It involves methods for protecting information and communications through the use of codes, so that only those for whom the information is intended can read and process it.
#2
Term
What is Symmetric Encryption?
Definition
Symmetric encryption (or secret-key encryption) uses a single, shared secret key for both encrypting plaintext into ciphertext and decrypting ciphertext back into plaintext. Both the sender and receiver must possess this same key.
#3
Term
Give an example of a Symmetric Encryption algorithm.
Definition
The Advanced Encryption Standard (AES) is a widely used and highly secure symmetric encryption algorithm. Other examples include DES (now considered insecure) and Triple DES (3DES).
#4
Term
What is Asymmetric Encryption?
Definition
Asymmetric encryption (or public-key encryption) uses a pair of mathematically related keys: a public key and a private key. The public key can be shared widely, while the private key must be kept secret. Data encrypted with one key can only be decrypted with the other.
#5
Term
Give an example of an Asymmetric Encryption algorithm.
Definition
The RSA (Rivest–Shamir–Adleman) algorithm is a prominent example of asymmetric encryption, commonly used for secure data transmission and digital signatures. Other examples include ECC (Elliptic Curve Cryptography).
#6
Term
What is the main difference between Symmetric and Asymmetric Encryption?
Definition
Symmetric encryption uses a single shared secret key for both encryption and decryption, offering high speed. Asymmetric encryption uses a public/private key pair, providing secure key exchange and digital signatures, but is computationally slower.
#7
Term
What is a Hashing Algorithm?
Definition
A hashing algorithm is a mathematical function that takes an input (or 'message') and returns a fixed-size alphanumeric string, called a hash value, message digest, or simply hash. Cryptographic hash functions are designed to be one-way (irreversible) and collision-resistant.
#8
Term
What are the key properties of a cryptographic hash function?
Definition
Key properties include:
1. Deterministic: The same input always produces the same output.
2. One-way (Preimage Resistance): Computationally infeasible to reverse the hash to find the original input.
3. Collision Resistance: Computationally infeasible to find two different inputs that produce the same hash output.
4. Avalanche Effect: A small change in input produces a significantly different hash output.
Showing 8 of 25 cards in this deck.
Study All Now