Відео

at 12:51 why should the value of alpha be less than 19? if not alpha can takes values of the form 19k+3 k starts from 0 ?

Wait you studied at CUA too? I'm in 2013 batch

// Generate a random number of a specific bit length uint64_t generateRandomNumber(uint32_t bitLength) { std::random_device rd; std::mt19937_64 gen(rd()); std::uniform_int_distribution<uint64_t> dis(0, (1ULL << (bitLength - 1))); return dis(gen); } uint64_t generatePrime() { uint64_t prime; do { prime = generateRandomNumber(64); } while (!primality_check(prime)); /* you may want to speed that up just a little */ return prime; } edit: also you shouldent expect to get your values right every try so you could do something like the following. void Generate() { while (p == q) { while(!p.IsPrime()) // these should be self explanitory p = Prime(BigInt::random(sizeof(uint64_t))); // Prime is just (2 * random) - 1 while(!q.IsPrime()) q = Prime(BigInt::random(sizeof(uint32_t))); n = p * q; calculate_phi(); calculate_e(); if (e > phi_n || e == phi_n) p = q; // if e is messed up make p and q the same and loop again. } calculate_d(); }

Is there a limit to the size of the keys your program can generate?

Well said😍

Thanks for clearing the basics ...

This video is a great blessing! It's very hard to find details onto why this method works, but you provided perfect explanation, which fill in all the gaps for me ❤

How can I contact you directly, I have a paid work for you

Thank you so much

Very interesting and informative, can you recommend me some books about cryptography for beginners?

really great explination ❤❤

holy moly thank you SOO much ! This is GOLD !

Aarigato Sofia kun.

Beautiful voice

At 7:41 7d = 1 mod 3120 might be calculated using Extended Euclidean Algorithm - might require less computation than guessing the number. Aside from that the material explains the topic very well ;)

Very clear explanation! I'm just a little confused about the very end. Where does the fact that M and N are coprime come from? I thought that the message M could be any integer.

Thanks, that was very helpful

An absolutely outstanding series of videos; I really enjoyed having the mechanics of this really important part of the web explained in such detail. I've read about the topic in a few few books, and seen some examples, but your videos really go through step by step and explain things so well.

I think at 10:04, this step is wrong, because [M * M^(k*phi(N)) ] mod n should not equivalent to M * [M^(k*phi(N)) mod n]. The correct version should be: **Method1:** Because M^phi(n) mod n = 1, M^phi(n) can be gn+1. So [M^phi(n)]^k = (gn+1)^k = (...)n + 1^k. so M * [M^phi(n)]^k = (M*...)n + M. so M^(1+phi(n)*k) = (M*...)n + M. so M^(1+phi(n)*k) mod n = [(M*...)n + M] mod n = M. **Method2:** M^phi(n) is congruent to 1 mod n, so [M^phi(n)]^k is congruent to 1^k mod n. so M*[M^phi(n)]^k is congruent to M*(1^k) mod n. so M^(1+ phi(n)*k) mod n = M.

Your calculations for RSA are not correct.

I like, very good.

Good Work Watch Baby Step Television Videos Leave A Comment Press Like Button subscribe share Watch Baby Step Radio Videos Leave A Comment Press Like Button subscribe share Watch Baby Step Records Artist Bobirdie Video Freedom Of Speech Leave A Comment Press Like Button subscribe share Watch Baby Step T.V Videos Leave A Comment Press Like Button subscribe share

Thank You. One day, I will surely understand this. I have watched your previous vidoes and tested the codes out in which I failed terribly but the process is on. I myself am studying computers and softwares but the institute doesn't really elaborate much on these kinds of things. Perhaps a little suggestion or something you can check out is competitive programming. Have a good day ahead.

Can you provide this code?

🥺🚬🗿👍

🧐🚬🗿👍

👍🚬🗿

if u want to make the proof in future and i hope that try to explain the elementary proof and thank u

so where is the proof 🤔 this facts the half of the planet knows it .

Thank you! It made my day.

Hi there, wonderful video. Is the source available to play around with or even use it?

I just quickly wanted to google how to create a RSA signature verifier as that's the only aspect I need. Well, didn't expect such an awesome channel solely dedicated to RSA. I really love it!

But how do we know that M^e < N? If this isn't the case it wouldn't work right?

At 14:45 you somehow take the M^1 out of the mod expression, which cannot be done, thus you cannot just simplify the other part to 1

Hello , you have instagram?)

How can I think about cryptography, hearing this beautiful female voice...

excellent sofia

it is very useful for learners. Thank you madam . Please give details of bob and Alice

Please note that Euler's Theorem is conventionally given as a^[phi(n)] mod n = 1 if gcd(a, n) is 1. Then have: M¹ ⋅ M^[phi(n)x] mod n (timestamp: 14:26) = M ⋅ (M^[phi(n)])ˣ mod n --> exponent rules = M ⋅ (M^[phi(n)] mod n)ˣ --> b/c aᵐ mod n = (a mod n)ᵐ = M ⋅ (1)ᵏ --> by Euler's Theorem = M ⋅ 1 = M Apologies for any confusion

that's not the euler's theorem. Euler's theorem states that if a and n are coprime, then a^(phi(n)) mod n = 1, there is no positive integer x that's in the exponent of a

You are proving it using Euler's theorem but, Euler's theorem only work when GCD(M, n) = 1. So in the case that GCD(M, n) > 1 then this didn't prove how RSA still works in that situation

Great video, thanks!!

thanks so much really helpfull and interesting :) keep up the good work

It's absolutely shocking how difficult it is to find proofs of well known theorems that go through the actual logic for why each steps was taken. Thank you for this.

what IDE did you used

ahh yes... beauty with brains.

I am just starting to learn to code and I wonder is there a reason why you used vectors for the primality check? I coded a function which returns true if the given number is a prime number.

Nicely done!

Thanks for this tutorials. Can you please help me with one thing please if you have time. Can you please share your ua-cam.com/video/gtwOfvf1wrc/v-deo.html This video RSA source code or GitHub. engjahidhasan20@gmail.com is my email, if you have some time please kindly share this code and related materials to study. I will be grateful for your help.

Nice tutorial. Can you please share this code or GitHub link. I'm writing my email address if you feel to share it. That would be very much helpful. engjahidhasan20@gmail.com