Back to AI Flashcard MakerInformation Technology /A Level Computer Science Paper 1: 1.3.1 - Compression, Encryption, Hashing

A Level Computer Science Paper 1: 1.3.1 - Compression, Encryption, Hashing

Information Technology23 CardsCreated about 1 month ago

Data compression reduces file sizes to save storage, bandwidth, and download time. It can be lossy or lossless, with lossy methods (like JPG) removing non-essential data to achieve higher compression ratios.

Compression advantages

  • Reduces download time

  • Uses less bandwidth

  • Takes up less storage

Tap or swipe ↕ to flip
Swipe ←→Navigate
1/23

Key Terms

Term
Definition

Compression advantages

  • Reduces download time

  • Uses less bandwidth

  • Takes up less storage

Compression disadvantages

  • Takes time to compress

- Uses processor time


Lossy compression

Where compression removes non-essential data. Compresses to a smaller size

JPG

Compresses pixels in an image by removing colours the human eye cannot distinguish between

MP3

Removes audio frequencies the human ear can’t detect

MP4

Only records changes in differences between picture frames of video rather than each entire frame

Related Flashcard Decks

Study Tips

  • Press F to enter focus mode for distraction-free studying
  • Review cards regularly to improve retention
  • Try to recall the answer before flipping the card
  • Share this deck with friends to study together
TermDefinition

Compression advantages

  • Reduces download time

  • Uses less bandwidth

  • Takes up less storage

Compression disadvantages

  • Takes time to compress

- Uses processor time


Lossy compression

Where compression removes non-essential data. Compresses to a smaller size

JPG

Compresses pixels in an image by removing colours the human eye cannot distinguish between

MP3

Removes audio frequencies the human ear can’t detect

MP4

Only records changes in differences between picture frames of video rather than each entire frame

Lossless compression

Patterns of data are summarised and recorded in a shorter format without removing any data
The original file can be recovered

Run Length Encoding

Summarises data by saying the data and how many times repeated data is repeated

Dictionary compression

Spots patterns of data that are repeated and stores them in a dictionary, stores in the main file
Any occurence of the repeated data will be replaced by its index

ZIP

Identifies repeated file content and replaces every occurence with a repeated code


End-to end encryption

The ciphertext is only decoded when it reaches the device of the recipient

Encryption

A way of making sure data cannot be understood if you don’t possess the means to decrypt it.
The message is encrypted using a cipher algorithm and key and decrypted when received

Ciphertext

The text produced by the cipher algorithm and key

Plaintext

The text produced when the ciphertext is decoded

Caesar cipher

A cipher in which each letter of the alphabet is shifted by the same amount

Vernam cipher

A random sequence equal than or greater in length than the plaintext is used once.
Works by using a XOR between the ASCII codes of the encrypted characters and the characters of the one-time pad.

Vernam cipher one-time pad

The encryption key (one-time pad) is shared with the recipient by hand and is destroyed immediately.
The one-time pad is generated from physical and unpredictable phenomena.


Symmetric encryption

Also known as private key encryption

The same key is used to encrypt and decrypt data so it must be shared with the recipient

Asymmetric encryption

The recipient’s public key is used to send data securely

Only the recipient’s private key can be used to decrypt the ciphertext

Hashing

Uses a hashing algorithm to map an input to a shorter length of hex characters
You cannot convert the encrypted message back to the original

Hashing uses


Storing PINS/passwords securely

Hashing salt

Adding random data to the input to change the hashing output

Compression

The process to reduce the storage space required by a file