| operations |
| comment | | "parent_author":"",<br>"parent_permlink":"cryptocurrency",<br>"author":"peaceandwar",<br>"permlink":"basics-of-cryptography-part-1-12",<br>"title":"Basics of Cryptography,<br> Part 1 \/ 12",<br>"body":"https:\/\/www.youtube.com\/watch?v=8CluknrLeys\n\nImagine we are living in prehistoric times. Now,<br> consider the following. How did we keep track of time without a clock? All clocks are based on some repetitive pattern which divides the flow of time into equal segments. To find these repetitive patterns,<br> we look towards the heavens.\n\nThe sun rising and falling each day is the most obvious. However,<br> to keep track of longer periods of time,<br> we looked for longer cycles. For this we looked to the moon,<br> which seemed to gradually grow and shrink over many days. When we count the number of days between full moons,<br> we arrive at the number 29.\n\nThis is the origin of a month. However,<br> if we try to divide 29 into equal pieces,<br> we run into a problem. It is impossible. The only way to divide 29 into equal pieces is to break it back down into single units. 29 is a prime number. Think of it as unbreakable.\n\nIf a number can be broken down into equal pieces greater than one,<br> we call it a composite number. Now,<br> if we are curious,<br> we may wonder how many prime numbers are there,<br> and how big do they get? Let\u2019s start by dividing all numbers into two categories. We list the primes on the left,<br> and the composites on the right.\n\nAt first they seem to dance back and forth. There is no obvious pattern here. So let\u2019s use a modern technique to see the big picture. The trick is to use a Ulam spiral. First we list all possible numbers in order in a growing spiral. Then we color all the prime numbers blue. Finally,<br> we zoom out to see millions of numbers. This is the pattern of primes,<br> which goes on and on forever.\n\nIncredibly,<br> the entire structure of this pattern is still unsolved today. We are on to something. So let\u2019s fast forward to around 300 BC in ancient Greece. A philosopher known as Euclid of Alexandria understood that all numbers could be split into these two distinct categories. He began by realizing that any number can be divided down over and over until you reach a group of smallest equal numbers.\n\nAnd by definition,<br> these smallest numbers are always prime numbers. So he knew that all numbers are somehow built out of smaller primes. To be clear,<br> imagine the universe of all numbers,<br> and ignore the primes. Now,<br> pick any composite number and break it down,<br> and you are always left with prime numbers. So Euclid knew that every number could be expressed using a group of smaller primes.\n\nThink of these as building blocks. No matter what number you choose,<br> it can always be built with an addition of smaller primes. This is the root of his discovery,<br> known as the fundamental theorem of arithmetic,<br> as follows. Take any number,<br> say 30,<br> and find all the prime numbers it divides into equally. This we know as factorization. This will give us the prime factors.\n\nIn this case,<br> 2,<br> 3,<br> and 5 are the prime factors of 30. Euclid realized that you could then multiply these prime factors a specific number of times to build the original number. In this case,<br> you simply multiply each factor once to build 30. 2 times 3 times 5 is the prime factorization of 30.\n\nThink of it as a special key,<br> or combination. There is no other way to build 30 using some other groups of prime numbers multiplied together. So every possible number has one,<br> and only one prime factorization. A good analogy is to imagine each number as a different lock. The unique key for each lock would be its prime factorization. No two locks share a key. No two numbers share a prime factorization.",<br>"json_metadata":" \"tags\":[\"cryptocurrency\",<br>\"cryptography\" ,<br>\"image\":[\"https:\/\/img.youtube.com\/vi\/8CluknrLeys\/0.jpg\" ,<br>\"links\":[\"https:\/\/www.youtube.com\/watch?v=8CluknrLeys\" ,<br>\"app\":\"steemit\/0.1\",<br>\"format\":\"markdown\" " | | vote | "voter":"peaceandwar",
"author":"peaceandwar",
"permlink":"basics-of-cryptography-part-1-12",
"weight":10000 |
|