Video Transcription

00:00

Hello and welcome back to Sai Buri. 2019 comp t A security plus certification purpose. In course,

00:09

we continue our discussion of marginal six, which in fact is domain six. And the topic of discussion will be cartography and PKR. In other words, public key infrastructure.

00:21

Surprisingly enough, we have a brand new learning object, which is six point to what we had to explain. Cryptographic allow algorithms and their basic characteristics.

00:30

The first item agenda is a pre assessment quiz

00:33

and what we need determine. First of all, which is the correct response for this particular question.

00:39

So without further ado

00:42

this particular

00:43

assessment res ask balls you are evaluating cryptographic algorithm for a customer.

00:50

The customer has a space specified requirement for encryption that uses share its secrets. You need to recommend an encryption algorithm that meet the requirement. Which AG with would you recommend or shoot you recommend is eight ah hashing algorithm. Be symmetric key algorithm. See

01:08

a symmetric key algorithm or elliptic

01:11

curve algorithm.

01:15

If you said to be, you're absolutely correct because it's a metric e algorithm requires a shared secret. Each communicating party has a shirt secret, which enables encryption and decryption the other algorithms do not use a shared key.

01:32

This brain is too

01:33

a topic of discussion, which encompasses this particular learn objective. We don't take a look at some symmetric. Add the where algorithm, in other words,

01:42

So first I want to take a look is called data encryption. Standard or days.

01:48

It's a standard block cipher algorithm. Design at IBM

01:52

that is used by many other algorithm is key sizes, 56 bits, and it's insecure.

01:57

They would have

02:00

advanced encryption stand it,

02:02

which is one of the most populous symmetric encryption algorithm. The key size is 128 1 92 as well as 256 bits.

02:13

Then we have the trip of days.

02:16

It was created as a possible replacement for deaths. The first design used 56 bit keys. New implementation used 112 bits, or 168 bit keys.

02:29

They were run called four, which is a scream cipher that performs well,

02:35

where, because of its speed and simplicity, it is considered unsecure by security experts.

02:42

Blowfish is a block cipher that has also developed as on Turner To dance. It can use a very bulky size that range from 32 bits to 448 bits.

02:53

Then we have to Fish, which is a block cipher developed as an alternative to A S uses a key size of 128 bits 199 to bits or 256 bits

03:07

Continue. Our discussion of this particular was a six point to where we don't need to explain, couldn't got angry with her and that basic characteristics. We're gonna turn on teacher toward discussing or highlighting a number of difficult we call cipher most.

03:21

So you may acts. Was a seif remote is in Agra that used a block cipher to provide infra securities such as company jelly or integrity.

03:30

The actual prices encryption can be reformed in many different kinds of ways. We call this a mode of operation.

03:39

Now let's take a look at Saiful moves.

03:44

We have the cipher block chaining basis is a block cipher mode of operation that encryption data.

03:51

Then we have the counter moat.

03:53

Based on what happen is a block a block cipher mode of operation that use hashing

03:59

over a binary basically goaless feel to provide both data authenticity,

04:04

integrity as well as comforted. Jolly.

04:08

There we have the Elektronik Cookbook. Basic is ah, block cipher mode of operation. That device, the message two blocks and encrypts each block separately.

04:17

We have a counter is a mode of operation, allows the block cipher to function like a scream cipher,

04:25

screen versus block a screaming block. Cyprus are symmetric Cyprus green.

04:30

Other words

04:31

The scream

04:33

and block ciphers are symmetric. What we call Cyprus screams in these sites are based on generate an infinite cryptographic all key scream by encrypting one bit of time. It combines block for additional security blocks as well.

04:55

Here getting some additional again topics which encompasses this particular

04:59

Lynn objective.

05:02

We have the R s A or reverse

05:06

Sherman Allman. Basically, this is one of the first public key crypto systems based on asymmetric algorithm. Are, as a published a public key that relies on two large prime numbers.

05:19

We have a digital signature algorithm which is against it a standard for digital 16 signatures in other words, the digital signals via message authentication, integrity as well as non repudiation.

05:31

Dfe Hellman is one of the first public key proposed protocols in the field up photography

05:40

groups that sometimes using photography to form primitive periods are low level algorithm often used for specific functions such as one way hashing functions.

05:53

Dfe Hyman

05:55

in mithril Basic is coming used to encrypt your transport sessions.

06:00

Elliptic curve cryptography for autonomous key agreement,

06:03

he let the kick curve

06:05

what we call our e C H D. H is a variant of D H

06:11

protocol. They uses elliptic curve using what we call elliptic curve cryptography for anonymous key agreement.

06:18

Pretty good privacy is an accurate other words. It's not Agron, but in fact, is a encryption program that provides cryptographic, authentication and as well as privacy.

06:30

The G N U, which is a privacy guard,

06:35

is a non priority, very free version of PGP.

06:41

Continuing our discussion of 6.2 week explains some cryptographic algorithm and basic characteristics. Let's not turn artist toward hashing algorithm

06:49

beginning first, all taking a look at MD five Shar h m a. C as well as the some additional ones as well.

06:59

Now we look at hashing algorithm. It is a key in public key encryption that's based on what we call a hash by you.

07:05

This is a value that is computed from a basic input number using what we call hashing algorithm. A hash algorithm creates a has co called a Message Digest or a message fingerprint.

07:21

The 1st 1 Take a look at MDS basis, one of the two most widely used hashing algorithm. The function takes on the import of arbitrary link and produces a message digest that's 120 1228 bit long. Other words. 128 bit hash value.

07:39

Typically run it as 32 bit hex, a decimal number.

07:43

Then we have the secure hash algorithm the function takes on. This function. Takes an input of arbitrary length. Produces a message. The digestive somewhere 128 bit long. Other words a hunter. A bit hash value typically rented at his 32 bit Hexi decimal type number.

08:01

Then we have a has based message authentication code. Now this is kind of is a basically type of message authentication code that they're five. Both the data integrity and the awesome to authentication off a message.

08:16

Then we have race basic. This a type of message authentication code that they're five. Both the data integrity and the authentication off a message.

08:26

Continuing our discussion of 6.2 would explain some cryptographic algorithm that basic characteristics won't take a look at at two types of key script scratching algorithms, as was our sophistication.

08:43

So the first they want to take a look. It's called Be Encrypt

08:48

is a password. Hash function is based on the blow office block. Cipher additionally, incorporates assault to produce or words to protect against a rainbow table type attack.

09:01

We have a password based Keep derivation basic. It helps reduce the vulnerability of in cryptic E to a brute force attack.

09:09

It applies what we call this

09:11

the

09:13

the hash,

09:15

which is the H Macy function to a password and salt value. Multiple time to produce a derived key

09:24

Observation is the act of hiding of obscuring something.

09:31

Let's look at some examples off Astra face oppression

09:35

basically have XO are

09:37

basis an additive cipher that's common use and many of your algorithms.

09:43

Then we have the rotate by 13 spaces, which is a cipher is a letter substitute cipher in which the letter of the alphabet offset 13 places. All instance of the letter a over place with the letter N and all incident be over place with letters. Zero.

10:01

Then we have a substitution cipher. It's the most common type of cipher and relies on replacing each letter of the plain text, including punctuation marks and spaces with another letter or random

10:13

symbol. In other words, at this point time, we have our post assessment quiz

10:18

and what in it reads as follows. Which symmetric block cipher superseded blowfish?

10:26

Is it a R S a b to fish? See MD five

10:31

or D p b d p b k D. F. Two

10:37

If you select the au? Absolutely. Because to fish is a symmetric key block cipher that replace Blowfish.

10:46

At this point, I we have a key takeaways. From this particular training presentation, we learned that the hash algorithm creates a has coat call, a message digest or Mrs Fingerprint.

10:58

We also learned the expectation is the act of hiding or obscuring something

11:03

in our upcoming video would be taking a look at our brand new learn object. It was at 6.3, and what you're giving a scenario and you have to install and configure while its security settings again. I look forward to seeing you in the very next

11:18

video

Up Next

CompTIA Security+

Interested in the cybersecurity industry? The CompTIA Security+ is the gold standard for those looking to enter the cybersecurity industry. Join thousands of professionals who have gained this certification through this course and launched their careers in information security.

Instructed By