Data Encryption: Symmetric vs. Asymmetric Key Algorithms and Concepts - Prof. Kevin Ohl, Study notes of Computer Science

An overview of data encryption, focusing on symmetric and asymmetric key algorithms. Symmetric encryption uses the same key for encryption and decryption, requiring key sharing between parties. Asymmetric encryption, on the other hand, uses two keys: a public key for encryption and a private key for decryption. The document also covers digital signatures, transactional vs. Repository encryption, and encryption tools like truecrypt.

Typology: Study notes

2012/2013

Uploaded on 12/11/2013

tiancailishen111
tiancailishen111 🇺🇸

1 document

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Data Encryption
oGeneral concepts
refers to mathematical calculations and algorithmic schemes
that transform plaintext into cypher text, a form that is non-
readable to unauthorized parties.
oPrivate key (Symmetric) encryption
Exact same key (scheme) is required on
both ends of the transaction
To create a key that is impossible to
crack, it needs to fulfill the following
requirements:
Random
As large or greater than plaintext
Never reused in whole or in part
Pros:1. Simpler algorithm than public key schemes
2. Generally faster than public key schemes
Cons: 1.Does not support large numbers of people
well.
2. How do you share a key.
oPublic key (Asymmetric) encryption
Encryption scheme must be defined,
however, instead of one key, you have
two
Public (encryption) key
Private(decryption) key
This scheme allows for encoding and
decoding of messages using two
different keys
A private key and a public key
belong to one party and are
mathematically related
oThe property that has to
be maintained is that a
public key is easy to
compute, if you know a
pf3
pf4
pf5

Partial preview of the text

Download Data Encryption: Symmetric vs. Asymmetric Key Algorithms and Concepts - Prof. Kevin Ohl and more Study notes Computer Science in PDF only on Docsity!

  • Data Encryption o General concepts refers to mathematical calculations and algorithmic schemes that transform plaintext into cypher text, a form that is non- readable to unauthorized parties. o Private key (Symmetric) encryption ▪ Exact same key (scheme) is required on both ends of the transaction ▪ To create a key that is impossible to crack, it needs to fulfill the following requirements:
  • Random
  • As large or greater than plaintext
  • Never reused in whole or in part Pros:1. Simpler algorithm than public key schemes
  1. Generally faster than public key schemes Cons: 1.Does not support large numbers of people well.
  2. How do you share a key. o Public key (Asymmetric) encryption ▪ Encryption scheme must be defined, however, instead of one key, you have two
  • Public (encryption) key
  • Private(decryption) key ▪ This scheme allows for encoding and decoding of messages using two different keys
  • A private key and a public key belong to one party and are mathematically related o The property that has to be maintained is that a public key is easy to compute, if you know a

private key, but difficult to un-compute

  • A public key is shared with others who use it to encode their messages
  • Only the owner of a private key, however, can decode them
  • Pros o Easy to deploy on mass scale o Also used with digital signatures ▪ What is a digital signature?
  • Cons o Not as fast as private key encryption o Not good for large volume encryption(i.e., masses of data versus bursts of data) o Transactional v Repository encryption ▪ Encryption can be
  • – Transactional - involves encrypting or decrypting on each side of an insecure channel (e.g., Internet)
  • – Resource-based - the encryption of an entire resource of data, such as a laptop or portable disk – data is stored in an encrypted form o Encryption tool: True Crypt o Encryption ▪ is the process of encoding messages (or information) in such a way that eavesdroppers or hackers cannot read it, but that authorized parties can

system is busy behind the scenes with the following tasks:

  • – It manages the processor
  • – It manages the memory
  • – It controls input and output devices
  • – It establishes basic elements of the user interface
  • – It keeps track of storage ▪ Storage management (logical vs physical; index file, fragmentation)
  • Acts as a filing clerk – stores and retrieves files. o Remembers the names and locations of all your files. o Keeps track of empty spaces where new files can be stored.
  • Index File – Who cares? o If index file becomes damaged, data becomes inaccessible o When you delete a file, the OS simply changes the status of the file’s clusters entry in the index table to “empty” and removes the filename from the index file. ▪ It does NOT remove the data, just the references to it – this is why it is possible to recover “deleted” files ▪ Old data is permanently

removed only when:

  • the empty cluster is used for the new file
  • you use special file shredder software that overwrite s
  • supposedl y empty sectors with random 1s and 0s
  • you physically destroy the medium
  • A Fragmented Disk o As computer files are added/deleted, parts of files tend to become scattered all over the disk ▪ These fragmented files are stored in noncontiguous clusters
  • Slows drive performa nce