RSA Algorithm - How does it work? - I'll PROVE it with an Example! -- Cryptography - Practical TLS

RSA Algorithm - How does it work? - I'll PROVE it with an Example! -- Cryptography - Practical TLS

Practical Networking

3 года назад

153,192 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

@rajuljain2902
@rajuljain2902 - 13.03.2025 07:41

This is a fantastic video, thank you!

Ответить
@olorundareagnes934
@olorundareagnes934 - 24.02.2025 15:30

You sure deserve an award, sir!

Ответить
@ArdentMusicLover
@ArdentMusicLover - 12.02.2025 20:12

You are indeed a gifted instructor! Thank you for such an amazing lucid explanation.

Ответить
@digioiam
@digioiam - 10.02.2025 18:52

Great video. thanks a lot. However I've a question: Public Key will be sent to the other peer, while Private Key will be kept on sender. But once E is sent on the other side, how it knows the N, to do the encryption? He must receive both the E and N, to do the encryption. Right?

Ответить
@n0ne0ne
@n0ne0ne - 10.02.2025 05:40

nice video but the title is misleading. This is not what a proof is

Ответить
@hugopnabais
@hugopnabais - 04.02.2025 02:25

$number = 1909
$range = 1..[math]::Sqrt($number)
$factors = @()

foreach ($i in $range) {
if ($number % $i -eq 0) {
$factors += $i
$pair = $number / $i
if ($pair -ne $i) {
$factors += $pair
}
}
}

$factors = $factors | Sort-Object
Write-Output ("Factors of " + $number + ": " + ($factors -join ', ')) , it takes no time with this code, faster than blincking an eye

Ответить
@MiaRuby-k7r
@MiaRuby-k7r - 01.02.2025 07:45

You're doing a fantastic job! I have a quick question: I have a SafePal wallet with USDT, and I have the seed phrase. (tag suit turtle raccoon orange fever main skull special hungry crystal mixture). What's the best way to send them to Binance?

Ответить
@declanoshaughnessy917
@declanoshaughnessy917 - 22.01.2025 22:59

Pretty sure E doesn’t need to be prime itself, just needs to be coprime with r

Ответить
@reamabdulsalam524
@reamabdulsalam524 - 19.01.2025 10:39

86 ????????

Ответить
@reamabdulsalam524
@reamabdulsalam524 - 19.01.2025 10:35

I ment you have jumped from 5 to 29 and you didn’t show us in the calculator how did you get the 86 ? You know we don’t we are learning you should slow done and explain in details 60 power 29 then what did you do ?

Ответить
@reamabdulsalam524
@reamabdulsalam524 - 19.01.2025 10:29

Too fast you did not work with 5 ! And jump on to 39 ! What is a reason for that ? Also when we rised the message to E you didn’t show us how did you get 86 ? Please don’t speed and explain in details

Ответить
@raki1190-y7i
@raki1190-y7i - 10.01.2025 22:36

Bravo! I thought I will never understand this topic!

Ответить
@karlcajmatz9274
@karlcajmatz9274 - 09.01.2025 17:07

This is fascinating! I have watched a few of your videos and I'm completely blown away by your ability to explain these concepts. Keep it up!

Ответить
@sonhoanglevinh7352
@sonhoanglevinh7352 - 08.01.2025 18:05

this video is so amazing(づ ̄3 ̄)づ╭❤~(づ ̄3 ̄)づ╭❤~

Ответить
@cjbios2080
@cjbios2080 - 29.12.2024 02:07

this video and the content, as all of the content of this topic, is mind blowing !! so well explained with great examples, i learnt a lot today!! big thank you for all of this!!

Ответить
@nomanbaluchi
@nomanbaluchi - 27.12.2024 10:34

thanks alot sir for clearing the concept with easy steps....... once again thanks alot

Ответить
@deany1620
@deany1620 - 24.12.2024 18:39

Excellent video. I was goofing off creating keys and encrypting short messages and found that the message value cannot exceed the product PQ. The values quickly cause overflows in Windows Calculator, does anyone recommend an app for manipulating this many significant digits?

Ответить
@mr_scofan
@mr_scofan - 11.12.2024 00:18

Great video, however you haven't really proven, in the mathematical sense, that RSA works for all inputs, just for your specific input. I'm sure it's been proven, and maybe there are many proofs, but this was just an exercise to show that it works with the number 60.

Ответить
@OmarAhmed-fh2nu
@OmarAhmed-fh2nu - 10.12.2024 23:01

hey man i just wanted to say a big thank you, i found this video from a reddit post, i was so close to leaving this topic off from my notes because i didnt understand it but im glad i didnt, thanks again and now im off to watch your DH video

Ответить
@deany1620
@deany1620 - 06.12.2024 04:06

Best explanation I've ever seen of RSA. Outstanding job!

Ответить
@Xmen-b5f
@Xmen-b5f - 30.11.2024 04:32

Ur great 🎉

Ответить
@42yilmazyusuf
@42yilmazyusuf - 22.11.2024 17:03

smooth explaining, thank you

Ответить
@pajeetsingh
@pajeetsingh - 10.11.2024 10:52

Do every pairs of prime numbers create semi-prime number?

Ответить
@pajeetsingh
@pajeetsingh - 10.11.2024 10:10

Better video than That British Asian dude.

Ответить
@lsrafa12
@lsrafa12 - 06.11.2024 11:04

Great video, thanks. How is it like today with AI? Are today's models able to defactor really big semi-prime numbers easily? How does it affect cryptography in general?

Ответить
@papuasingo6489
@papuasingo6489 - 27.10.2024 12:30

thanks it is so clear.

Ответить
@GalacticTheOne
@GalacticTheOne - 24.10.2024 11:09

This is an awesome session of understanding RSA with a working example.

Ответить
@wildmanjeff42
@wildmanjeff42 - 20.10.2024 00:42

very cool video, thank you for explaining with math !

Ответить
@majiddehbi9186
@majiddehbi9186 - 19.10.2024 18:03

great

Ответить
@jug94
@jug94 - 14.10.2024 08:42

Please please keep teaching you are really making differences in peoples life. I would love to meet you in person and/or help/contribute in anyway possible.

Ответить
@qanboura
@qanboura - 13.10.2024 00:10

thank you very much

Ответить
@Keusimbomlaihausinomsim-x5v
@Keusimbomlaihausinomsim-x5v - 08.10.2024 15:15

Bette Garden

Ответить
@WoolleyClarence-r9v
@WoolleyClarence-r9v - 02.10.2024 20:41

Boyd Via

Ответить
@maestrocorporate5804
@maestrocorporate5804 - 01.10.2024 16:12

Wow Ed makes it so clear and easy to understand.

Ответить
@americanguzziguy
@americanguzziguy - 25.09.2024 17:23

Thank you so much!

Ответить
@CynthiaShumaker-y8y
@CynthiaShumaker-y8y - 21.09.2024 16:26

Hamill Pine

Ответить
@ashkannasirzadeh1052
@ashkannasirzadeh1052 - 20.09.2024 03:08

U talk about technology like a fascinating story, perfect explanation, thank u

Ответить
@EllisNicholas-u3p
@EllisNicholas-u3p - 19.09.2024 12:26

Tremblay Stravenue

Ответить
@MicheleSmith-h3z
@MicheleSmith-h3z - 17.09.2024 03:40

Abigale Junction

Ответить
@cafeden6868
@cafeden6868 - 12.09.2024 19:14

You're such a great instructor.

Ответить
@zxtqwwr0
@zxtqwwr0 - 05.09.2024 21:17

Amazing explanation, so easy to understand.

Ответить
@gyangp810
@gyangp810 - 28.08.2024 19:58

You are the best tutor I have ever seen

Ответить
@dannee3878
@dannee3878 - 18.07.2024 20:41

nice video keep it up

Ответить
@mauisstepsis5524
@mauisstepsis5524 - 11.07.2024 04:11

21 * 21 has factor of 21, 21*21 it's not semi prime

Ответить
@kananahmed
@kananahmed - 06.07.2024 09:43

But if someone managed to get the public key wouldn’t they can decrypt all cipher tex?

Ответить
@RagazzaInk
@RagazzaInk - 03.07.2024 12:20

wow you are a great teacher...later of a few videos finally I can understand 😂

Ответить