1.3.1 (c) Symmetric & Assymmetric Encryption

0.0(0)
studied byStudied by 2 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/14

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

15 Terms

1
New cards

What are the two different types of encryption?

  • symmetric

  • asymmetric

2
New cards

What is encryption?

process of encoding a message so it can be read only by sender & intended recipient

3
New cards

What is symmetric encryption?

sender & receiver have the same private key (key used for both encrypting & decryption message)

4
New cards

What are advantages of symmetric encryption?

  • simple to implement

  • efficient & faster for large data than asymmetric as it is less complex

5
New cards

What are disadvantages of symmetric encryption?

  • single point of failure - if private key compromised attacker can decrypt easily

  • not scalable for large networks

6
New cards

What is asymmetric encryption?

sender and receiver have unique keys (key pair):

  • public key - anyone can access, encrypts message

  • private key - only recipient has access, unlocks content, decrypts message

7
New cards

What are advantages of asymmetric encryption?

  • secure w/o needing to share private keys

  • enables data signatures - verify sender’s identity & ensure data hasn’t been changed

8
New cards

What are disadvantages of asymmetric encryption?

  • slower for large data

  • computationally expensive

9
New cards

What is hashing?

a function that transforms a string of character into a fixed-length value/key that represents the original

10
New cards

How is hashing different from encryption?

one way process - hash function can’t be reversed to form the key

11
New cards

What are uses of hashing?

  • storing passwords

  • digital signature - verify sender’s identity & ensure data hasn’t been changed

  • hash tables - data structure that holds key pairs

12
New cards

What is a collision in term of collision?

when two different inputs produce the same hash value

13
New cards

How can a collision be prevented?

salting - adding a random value to the password before hashing it

14
New cards

What are advantages of hashing?

  • irreversible - very secure for storing private data

  • enables integrity checks - can be used to verify data hasn’t been altered

15
New cards

What are disadvantages of hashing?

  • vulnerable to brute-force attacks

  • collision risks if algorithms are weak