Комментарии:
wow you are a great teacher...later of a few videos finally I can understand 😂
ОтветитьBut if someone managed to get the public key wouldn’t they can decrypt all cipher tex?
Ответить21 * 21 has factor of 21, 21*21 it's not semi prime
Ответитьnice video keep it up
ОтветитьYou are the best tutor I have ever seen
ОтветитьAmazing explanation, so easy to understand.
ОтветитьYou're such a great instructor.
ОтветитьAbigale Junction
ОтветитьTremblay Stravenue
ОтветитьU talk about technology like a fascinating story, perfect explanation, thank u
ОтветитьHamill Pine
ОтветитьThank you so much!
ОтветитьWow Ed makes it so clear and easy to understand.
ОтветитьBoyd Via
ОтветитьBette Garden
Ответитьthank you very much
Ответить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.
Ответитьgreat
Ответитьvery cool video, thank you for explaining with math !
ОтветитьThis is an awesome session of understanding RSA with a working example.
Ответитьthanks it is so clear.
Ответить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?
ОтветитьBetter video than That British Asian dude.
ОтветитьDo every pairs of prime numbers create semi-prime number?
Ответитьsmooth explaining, thank you
ОтветитьUr great 🎉
ОтветитьBest explanation I've ever seen of RSA. Outstanding job!
Ответить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
Ответить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.
Ответить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?
Ответитьthanks alot sir for clearing the concept with easy steps....... once again thanks alot
Ответить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!!
Ответитьthis video is so amazing(づ ̄3 ̄)づ╭❤~(づ ̄3 ̄)づ╭❤~
Ответить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!
ОтветитьBravo! I thought I will never understand this topic!
Ответить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
Ответить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 ?
Ответить86 ????????
ОтветитьPretty sure E doesn’t need to be prime itself, just needs to be coprime with r
Ответить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?
Ответить$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
nice video but the title is misleading. This is not what a proof is
Ответить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?
ОтветитьYou are indeed a gifted instructor! Thank you for such an amazing lucid explanation.
ОтветитьYou sure deserve an award, sir!
ОтветитьThis is a fantastic video, thank you!
Ответить