Unit 4 Exchanging Data Flashcards
What name is given to the public and private keys used in asymmetric encryption?
Key pair
Name the two categories of compression
Lossy and lossless
In which type of compression is the quality of a file not degraded?
Lossless
What is the purpose of encryption?
To keep data secure during transmission
Name one type of lossless compression
One from:
● Run length encoding
● Dictionary encoding
In which form of encryption do the sender and receiver share the same private key?
Symmetric encryption
How many keys are used in asymmetric encryption?
Two (one public and one private)
If person A wants to send a message to person B using asymmetric encryption, which key should they use to encrypt the message?
B’s public key
A message encrypted with B’s public key can only be decrypted with B’s private key, which only B has access to
What is said to have occured when two keys map to the same hash?
A collision
In which kind of lossless compression are repeated characters replaced by one occurrence and the number of times to repeat the character?
Run length encoding
What name is given to the process of turning an input into a fixed size value?
Hashing
Which data structure uses hashing to store information with constant lookup time?
Hash table
What is meant by compression?
The process of reducing the space required to store a file
Name two properties that a hashing algorithm should have
● Low chance of collision
● Quick to calculate
● Output smaller than input
Lossy compression
Lossy compression reduces the size of a file while also removing some of its information. This could result in a more pixelated image or less clear audio recording.
Lossless compression
Lossless compression, the original file can be recovered from the compressed version. Something which is not possible when using lossy compression which reduces the size of the file by completely disregarding some information.
Run Length Encoding
Run length encoding is a method of lossless compression in which repeated values are removed and replaced with one occurrence of the data followed by the number of times it should be repeated.
What would the string AAAAAABBBBBCCC be represented as
A6B5C3
Dictionary encoding
Dictionary encoding is another example of a method of lossless compression. Frequently occurring pieces of data are replaced with an index and compressed data is stored alongside a dictionary which matches the frequently occurring data to an index. The original data can then be restored using the dictionary.
Encryption
Encryption is used to keep data secure when it’s being transmitted.
Symmetric Encryption
In symmetric encryption, both the sender and receiver share the same private key, which they distribute to each other in a process called a key exchange. This key is used for both encrypting and decrypting data.
It’s important that the private key is kept secret. If the key is intercepted during the key exchange then any communications sent can be intercepted and decrypted using the key. Asymmetric encryption gets around this issue.
Asymmetric Encryption
When sending information using asymmetric encryption, two keys are used: one public and a second, private, key. The public key can be published anywhere, free for the world to see, while the private key must be kept secret. Together, these keys are known as a key pair and are mathematically related to one another.
Hashing
Hashing is the name given to a process in which an input (called a key) is turned into a fixed size value (called a hash).
Relational Databases
Relational database work by splitting data about different entities (types of things) into separate relations (tables). Each relation only contains data about one entity and relationships (connections) are made between each of the relations through the use of primary and foreign keys.