Blockchain tutorial 9: Discrete logarithm

Рет қаралды 40,608

7 жыл бұрын

This is part 9 of the Blockchain tutorial explaining what discrete logarithms are.
In this video series different topics will be explained which will help you to understand blockchain.
Bitcoin released as open source software in 2009 is a cryptocurrency invented by Satoshi Nakamoto (unidentified person or group of persons).
After the introduction of Bitcoin many Bitcoin alternatives were created. These alternate cryptocurrencies are called Altcoins (Litecoin, Dodgecoin etc).
Bitcoin's underlying technology is called Blockchain.
The Blockchain is a distributed decentralized incorruptible database (ledger) that records blocks of digital information. Each block contains a timestamp and a link to a previous block.
Soon people realises that there many other use cases where the Blockchain technology can be applied and not just as a cryptocurrency application.
New Blockchain platforms were created based on the Blockchain technology, one of which is called Ethereum.
Ethereum focuses on running programming code, called smart contracts, on any decentralized application.
Using the new Blockchain platforms, Blockchain technology can be used in supply chain management, healthcare, real estate, identity management, voting, internet of things, etcetera, just to name a few.
Today there is a growing interest in Blockchain not only in the financial sector but also in other sectors.
Explaining how Blockchain works is not easy and for many the Blockchain technology remains an elusive concept.
This video series tries to explain Blockchain to a large audience but from the bottom up.
Keywords often used in Blockchain conversation will be explained.
Each Blockchain video is short and to the point.
It is recommended to watch each video sequentially as I may refer to certain Blockchain topics explained earlier.
Check out all my other Blockchain tutorial videos
goo.gl/aMTFHU
Subscribe to my KZfaq channel
goo.gl/61NFzK
The presentation used in this video tutorial can be found at:
www.mobilefish.com/developer/b...
#mobilefish #blockchain #bitcoin #cryptocurrency #ethereum

Пікірлер: 26

@Mobilefish 7 жыл бұрын

At 3:10, I mentioned that the base value 3 and 5 are called the primitive root or generators. I forgot to mention that they are also called the primitive elements.

@ivannovotny7511 5 жыл бұрын

Can I in cryptographic key exchange choose any base? Because I'm afraid that when I randomly choose the remainder( b^x(mod p) = something), the shared public "b" may not be a primitive root of "p". Or most of remainders have more primitive roots and this does not matter?

@rishabdhar6900 4 жыл бұрын

@@ivannovotny7511 It matters based on what I understand, because if by random you choose a weak generator, you'll have a cyclic group that is much smaller, and also because the whole concept of digital signatures breaks down, because everyone is using a different random base to generate their key pair (which could be solved via a protocol upgrade, but the former weakness is still not avoided).

@aaallami 4 жыл бұрын

Oh man, I really cannot thank you enough for such an amazing video. It is very clear and handy. Please keep it up.

@kmunson007 10 ай бұрын

Absolutely amazing. I had to go through a lot of overly complicated videos before I finally found this one - thanks!!!

@user-ki8ns1ir3s 3 жыл бұрын

Why can`t others explain it as clearly as you? I really appreciate your work!

@KrisAkaVenno 6 жыл бұрын

Topic very well covered. Thank you a lot :)

@yechiavii 5 жыл бұрын

Great explanation Thank YOU!

@aris.konstantinidis 3 жыл бұрын

Thank you. Best explanation ever!

@ehguyg 2 жыл бұрын

coming back from tutorial 11 is the "parameter=n, the order of the base point α (generator)" in this example is when 2^10 where the cycle starts over? Therefore from SEC 2 parameter n =10 for this example?

@aion2177 5 жыл бұрын

very valuable content. Thank you:) Still need to re-watch a few of this videos again. Is very interesting how all this wired math properties come together to form one single system in bitcoin. Makes you wonder what other useful constructs one can create by putting together other wired math properties.

@mbharatm 6 жыл бұрын

Wow! Thanks a lot! :)

@franciscov2431 6 жыл бұрын

epic explanations. well done! thanks you very much. I pretty much never comment anything, but this video is worth a thank you.

@beterhans 6 жыл бұрын

This one is the best

@ShahzadKhan-zq9ty 4 жыл бұрын

very helpfull content ...

@boots160_ Жыл бұрын

Legendary content Thank you 🙏

@VitalJeevanjot 2 жыл бұрын

Hello, Thank you for creating and sharing this, I have a question. at 4:00 shouldn't it be 7 = 3^x mod 17 in the third point? If it continues the same example from the third point where the exponent is already known as 11....

@hachimitsuchai 6 жыл бұрын

Now it's getting nitty gritty :)

@jimgee1000 5 жыл бұрын

At 0:57, you say 8 is the remainder i.e. 'where: x = exponent, 2 = base, 13 = modulus, 8 = remainder' Is 8 really the remainder? Log base 2 of 8 gives an exponent of 3, and 3 modulo 13 is congruent to 3. What am I missing?

@sarahali6946 4 жыл бұрын

great

@jimgee1000 5 жыл бұрын

In this video, you say the valid range of remainders is (1... p-1) i.e. 1 to 6, since the modulus is 7. But in a previous video you said that the range for modulo remainders is (0... p-1). Since you didn't give a reason for the difference, I'm wondering if I missed some information along the way.

@EnFuegoDuo 3 жыл бұрын

I know this is old, and I assume you now know the answer. However, someone else may not. So, the answer is, if your exponent is 0, your answer is zero, and thus not useful for the task at hand. Edit: My mistake! The value when zero is the exponent is always 1! Not zero!