This is amazing. Followed through the whole video with little to no questions. Thank you very much for this. There's not a lot of detailed videos out there that explain the guts and mathematics of this algorithm.
I have to write my own hashing algorithm as my final work at school and this video helped me a lot. Thank you very much, great job. I really enjoyed it and it was really helpful.
@@Imisambi I finished the work about a week ago, it works pretty well, the teacher gave me 96%, so I am happy. I gained lots of new knowledge, so I was (and still am) able to answer questions in this topic, such as for example your coment, so I also can see some practical impact in my life 😀
Your explanation was awesome. You have explained everything from scratch. The video is complete it its own. Can you please make the video on "Elliptic Curve Cryptography" in the same way. That will be very helpful for us. Thank you in advance😊
Just some quick and honest feedback, there is a typo at 5:32 where variable is spelled as "vairable". Besides that, this video and the explanation was really great, thanks.
You've got three inputs: x, y and z. All in binary. You use logical operator "and" between (x) and (y), then you use "and" between (negated x) and (y), so you got two values, and you XOR them to get one final value.
@@Imisambi you've got logical operator "and", which means that if you have to inputs, here X and Y, you get output "1" for each situation, where both X and Y equal to 1, in other cases the output is 0. if X = 1 and Y = 1: output = 1 if X = 1 and Y = 0: output = 0 if X = 0 and Y = 1: output = 0 if X = 0 and Y = 0: output = 0 so for example: X: 1100 Y: 1010 →1000 (1 and 1 → 1, 1 and 0 → 0, 0 and 1 → 0, 0 and 0 → 0) you compare first character of X (here 1) with first character of Y (also 1) and operator "and" means, that if both X and Y are 1, the first character of output is also 1. Then you compare second characters, third, and so on, until you have compared full message. ((not X) and Y) works the same way, but "not X" means that the value of what you compare is opposite tha what it was. Simply, if X = 1 than (not X) = 0, and if X = 0 than (not X) = 1. Then you just compare this value you got with Y value the same way as before. Example: X: 1100 not X: 0011 Y: 1010 → 0010 - you compare (not X) and Y via logical "and" (so 0 and 1 → 0, 0 and 0 → 0, 1 and 1 → 1, 1 and 0 → 0) Did you get it? If you have other quetions, no problem to ask me
I have a question, if a message is converted into a binary number where each character is converted into the ascii binary value, and then concatenated together. if this exceeds 512 (or 447 due to the extra 1 and the 64 bits), would that mean I would have to start a new message block or adjust the current one to a 1024 bit message block
oh I've figured it out, the algorithm already deals with it as the message (let the binary length be n), takes up (let k be the multiple of 512 needed) (k-1) * 512 and the length required(k * 512) so the rest works as usual where its modded with 512 and then subtracted from 448 to get padded length, and ofcourse the 64 is already taken out for the rest of the padding with the binary number of the length of the binary number of the message.
This is amazing. Followed through the whole video with little to no questions. Thank you very much for this. There's not a lot of detailed videos out there that explain the guts and mathematics of this algorithm.
Thank you so much for the nice feedback! Glad you learned from this video 😀
True
Best Sha-256 video so far! Thanks for sharing!
Thank you so much 😀
Godlike video. Thank you for making my life 10x easier. Most guides online are worthless
I have to write my own hashing algorithm as my final work at school and this video helped me a lot. Thank you very much, great job. I really enjoyed it and it was really helpful.
Happy to hear that it helped you! Thank you for watching 😀
How was your final work assignment and how are your studies?
@@Imisambi I finished the work about a week ago, it works pretty well, the teacher gave me 96%, so I am happy. I gained lots of new knowledge, so I was (and still am) able to answer questions in this topic, such as for example your coment, so I also can see some practical impact in my life 😀
@@riyansikaa5279 🌟🌟CONGRATULATIONS🌟🌟
@@riyansikaa5279
How did you call your new hash algorithm ?
This is the best video that i have ever seen on SHA-256.
Love from Bangladesh 🇧🇩(4 january,2022)
Thank you so much! 😊
Omg. Absolutely amazing explanation ❤️❤️
I searched the entire youtube and couldn’t find a better explanation.
Thanks for existing.
This detailed explanation is a life saver. Thanks a lot !
absolutely brilliant, a well explained video with good pictorial representations
Thank you so much! 🥳
Next Level explaination. Great!
Amazing presentation with crystal clear explanation
Thank you 😀
Thanks! The most detailed explanation of sha256!
As I wrote earlier, great video. But what is constant K at 27:31? Maybe I'm dumb but I cannot find out
Oh, I am an idiot, I found that at 19:50, sorry
Your explanation was awesome. You have explained everything from scratch. The video is complete it its own. Can you please make the video on "Elliptic Curve Cryptography" in the same way. That will be very helpful for us. Thank you in advance😊
Just some quick and honest feedback, there is a typo at 5:32 where variable is spelled as "vairable". Besides that, this video and the explanation was really great, thanks.
Don't quite comprehend #5 choice function at 18:50 ....🤨
You've got three inputs: x, y and z. All in binary. You use logical operator "and" between (x) and (y), then you use "and" between (negated x) and (y), so you got two values, and you XOR them to get one final value.
@@riyansikaa5279 Thank you ..so what is the result from X & Y .. and NOT X & Y ? thank you
@@Imisambi you've got logical operator "and", which means that if you have to inputs, here X and Y, you get output "1" for each situation, where both X and Y equal to 1, in other cases the output is 0.
if X = 1 and Y = 1:
output = 1
if X = 1 and Y = 0:
output = 0
if X = 0 and Y = 1:
output = 0
if X = 0 and Y = 0:
output = 0
so for example:
X: 1100
Y: 1010
→1000 (1 and 1 → 1, 1 and 0 → 0, 0 and 1 → 0, 0 and 0 → 0)
you compare first character of X (here 1) with first character of Y (also 1) and operator "and" means, that if both X and Y are 1, the first character of output is also 1. Then you compare second characters, third, and so on, until you have compared full message.
((not X) and Y) works the same way, but "not X" means that the value of what you compare is opposite tha what it was. Simply, if X = 1 than (not X) = 0, and if X = 0 than (not X) = 1. Then you just compare this value you got with Y value the same way as before. Example:
X: 1100
not X: 0011
Y: 1010
→ 0010 - you compare (not X) and Y via logical "and" (so 0 and 1 → 0, 0 and 0 → 0, 1 and 1 → 1, 1 and 0 → 0)
Did you get it? If you have other quetions, no problem to ask me
@@riyansikaa5279 💚💚💚💚💚
Can i use this for my school project
greatttt.. thanks a lot
welcome :)
can u plse provide the link to download the ppt?
from where do we get the value of K constant?
I have a question, if a message is converted into a binary number where each character is converted into the ascii binary value, and then concatenated together. if this exceeds 512 (or 447 due to the extra 1 and the 64 bits), would that mean I would have to start a new message block or adjust the current one to a 1024 bit message block
oh I've figured it out, the algorithm already deals with it as the message (let the binary length be n), takes up (let k be the multiple of 512 needed) (k-1) * 512 and the length required(k * 512) so the rest works as usual where its modded with 512 and then subtracted from 448 to get padded length, and ofcourse the 64 is already taken out for the rest of the padding with the binary number of the length of the binary number of the message.
Can we measure the encryption time of SHA-256 from server to client and vice versa?
Hello! Thanks for watching. Apologies but I am not that sure how to measure the encryption time. I’ll share it with you once I discover how. 😀
the representation is as good as the explanation.
amazing explanation finally understood thanks
amazing
thank u
Thanks 😀
Wow its really helpfull and eazy understandable than you 😍👍😘
2^64 is infinitely large?
Its infinity for calculator app but not for cmd it wil calculate in seconds
background music ruins this