SLR09 - Compression encryption & hashing

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 6:09 PM on 2/22/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

16 Terms

1
New cards

Purpose of compression

  • ↓ size file

  • ↓ download time

  • ↓ storage requirements

  • make best use of bandwidth

2
New cards

Lossy compression

  • Some data lost

  • Slightly ↓ quality

  • Significantly ↓ file size

  • Suitable for: image, audio, video

3
New cards

Lossless compression

  • None orig data lost

  • Orig file can be recreated when it is uncompressed

  • Suitable for: executable files & documents

4
New cards

Methods of lossless compression

  • Dictionary coding: text based documents

  • Run-length coding: images

5
New cards

Dictionary coding

  • Builds index using every data item/entry in file 

  • File is now made up of:

    • Dictionary index

    • Sequence of occurrences needed to recreate orig file

<ul><li><p>Builds index using every data item/entry in file&nbsp;</p></li><li><p>File is now made up of:</p><ul><li><p>Dictionary index</p></li><li><p>Sequence of occurrences needed to recreate orig file</p></li></ul></li></ul><p></p>
6
New cards

Run length coding

  • ideal for bitmap images

  • There may be continuous pixels of the same colour 

  • So instead of storing each one individually, information stored in frequency/data pairs:

    • 22 0: 22 continuous white pixels

    • 6 1: 6 continuous black pixels

7
New cards

Explain why compression is important for the streaming of high resolution films

knowt flashcard image
8
New cards

Symmetric encryption

  • Uses a single key during encryption & decryption

  • Both parties know the key

9
New cards

How can a symmetrically encrypted message be cracked?

  • Interception of key

  • Duplication of key production process to acquire a copy of the key

10
New cards

Asymmetric encryption

  • Each party has a pair of keys

  • Message encrypted by one key, decrypted by the other

  • One key is public - anyone can access, the other is private

11
New cards

How sending a file using asymmetric encryption works

  • Sender & recipient exchange public keys

  • Sender uses recipients public key to encrypt message

  • Recipient uses private key to decrypt

12
New cards

How to confirm that a message is authen

  • Encrypt message with private key

  • Anyone can access public key & decrypt - confirmed authentic

13
New cards

Sending direct message

  • Send using:

    • Own private key

    • Recipients public key

  • Decrypted using:

    • Their private key

    • Own public key

14
New cards

Hashing function

  • Transforms string of characters into fixed length value or key

  • One way

15
New cards

How hashing function used to check password

  • Apply function on inputted password

  • Compare hashed vale to stored value

16
New cards

How can hashing be used for quick data storage & retrival

  • When storing, apply, function on string being stored

  • Store the string in the address corresponding to the value generated

  • When retrieving, run function again and retrieve value held in the given value - remove need to search