Cloud Native Computing Foundation KubeCon + CloudNativeCon North America 2021, 29 Oct 2021

Previous Meeting Next Meeting

⏯

youtube image

►

From YouTube: Deciphering Your Way to the World of Golang - Mritunjay Sharma, JSSATE Noida

Description

Don’t miss out! Join us at our next event: KubeCon + CloudNativeCon Europe 2022 in Valencia, Spain from May 17-20. Learn more at https://kubecon.io The conference features presentations from developers and end users of Kubernetes, Prometheus, Envoy, and all of the other CNCF-hosted projects.

Deciphering Your Way to the World of Golang - Mritunjay Sharma, JSSATE Noida

A World War-II memo has been found, a mystery is about to unravel and Agent Mritunjay needs your help. The road to lost treasure goes through the mysterious message and Agent Mritunjay is on a mission to decipher it - are you ready to join him in this journey? Pack your bags, put on your spooky hoodie, get that hacker hat on and open that terminal screen to get ready to Go! This is not merely a workshop - this is your journey with Agent Mritunjay to find the lost treasure but wait a minute - how do you plan to decipher the message? Don't you worry - Agent Mritunjay - to your rescue! Join him to learn about the fundamentals of Golang in this special Student's Track workshop where you will learn how Go modules work, what are Go packages, how functions interact to build into an algorithm that will not only help you solve the mystery with your first Golang CLI app but also pave your way to cloud-native projects like Kubernetes, Helm, etcetera. So what are you waiting for? Let's go!

A

Oh, I'm not wearing glasses.

A

What kind of an agent is! This doesn't wear glasses, but right now I don't have what happened when we will use zoom filters. So let me first use the filter. Let me first with the classes and then we will talk. What are we here for okay, I mean this looks good yeah, I mean somewhat swaggy, somewhat somewhat somewhat good somewhat like an agent. Of course we are here today and yes, this is agent within jet. Now you must be wondering what an agent wearing with glasses is going kubecon.

A

It's cloud native america, los angeles, north america, welcome to the conference, but before that you must be wondering why why an agent fine agent is required.

A

Will have to see this why in this 30 minute, I hope that it covers and discovered in 30 minutes uh why we are required here why you are required here and why this is going to be a super fun session. This is not going to be.

A

You know, like a tutorial, I'm not saying that it's a tutorial, I'm not saying that you will learn, go what we are going to learn today in just these 30 minutes, but it's going to be an awesome introduction and you require not a coder this time you require an agent, let's begin so uh before anything, let's share the screen and at least become a little formal till now it has been quite quite quite informal.

A

So uh before I share the screen, let me just see if the screen looks good yeah the screen looks good. Now I appreciate the screen. The agent always checks, everything working, fine or not so.

A

The screen is shared now, I'm going to present, the agent begins to present. Oh, my god search expand. Now.

A

What are we here for okay, they're shiftering, your way to the world of golang? I mean what a name of the top such a difficult name. First of all, but okay, you're welcome you're! Welcome today uh in the shaft fitting or design feelings, I guess I'm weak at pronunciations, but I think it's written so somewhat.

A

It is just a feeling, the way to the world of pro lang, and today we are here at kubecon cloud native con north america 2021 happening in a blended mode and thankfully uh we are moving towards the normal routine and hopefully, in the next year we will all be having in-person conference itself only and- uh and thank you so much to everybody who has joined us today, and I know that this talk is going to be. You know a little informal, a little story like a little daylight, because I mean virtually engaging.

A

The audience is difficult, but agent mckenzie is thinking he will do the honors. Let's begin.

A

What are we here for, but before what we are here for, let's see who I am so hello- I mean till now with my glasses. You already know that I am aj, I'm also a finally a computer science, engineering student in india and also well. I have been interning at hyper bank for now about more than three months, and let's not talk about that. Let's talk about the reason why we are here because yeah I mean all this is fun, but what what are we going to do?

A

What is an agent going to do in this? You know all I mean they are also big borders, all okay, all open source committee, members and nation. The spy has come here. uh There must be something some some very important reason for that, so a memo lost tradition, a mystery of the second world war.

A

Now I think these few terms that you are seeing, you must be wondering that yeah you require an agent, a spy agent or what kind of canadian we don't know, but here we are, and we need to go now before somebody else catches the treasure. But what? What is the memo about? What is the lost treasure about?

A

Let's see that the memory- oh my god, this looks some really really really old memo and, as they said, a second world war type number. What is this written? I mean second world war will end in few days: okay, yeah. It has ended a long time back, thankfully, and peace will come. Peace has come. Thank you so much, but I want to leave something for you. What a treasure a pleasure.

A

Pleasure, the road to this treasure is written in a code I mean a code, do we have to write program? Do we like to have code? No? No, no! No, they have given a code; okay, just refer it below, and it's all yours, my god. I mean this is our code. We have to decipher this. You have to figure out what is this, but you have to figure it out because treasure is involved after all and we are going to hunt it down. But how I mean this looks scary. I mean what is this code?

A

Five, seven, six, five, six c, six, three, six f! F! Sixty I mean I will forget it. I'm sorry I'll forget it. I hope you are also not you know, figuring out trying to figure out like how can you figure out this? This is this. Is.

A

I scary: what can be this, how to even solve with this? How what what can be the approach for this I mean I wish I wish this was an in-person conference. I mean this isn't blended comment, but I wish this could have been in person talk. I could have invited some of you to help me, but I mean this looks difficult. This looks difficult, but we are ready.

A

I am ready. Are you ready? Are you ready for the treasure hunt?

A

Let's go, let's go, let's go, but before going, let's do some homework. Investigation agents, love investigation. So now what are we going to do? We are going to investigate what, of course, the code. Let's go back to the code, let's go back to the code and try to figure out a few things.

A

If you look at this, if you look at this code, you know in the older days the typewriter used to write one as I. So this is not. I is one. This is an important point to note and if we look at this code there is one one one. One interesting observation.

A

They are all export you see, there is, if you see the range of alphabets or numerics used, they are between 0 to f. What does this mean? This means, of course, that you are, you know, trying to figure out things if you are trying to figure out things. This is something something something something interesting happening.

A

What can we do x4 if it is export, then what what next.

A

Investigation is on the code, the code. The code is xcode, the next point that if we look at it is encrypted, this is an encrypted code. Of course, of course it is encrypted that is known. I know that. But if you look at this, can it be zoro description? Can it be encryption?

A

This is a very, very favorite problem of uh almost all those involving encryption description.

A

This is one of the most fundamental things that we are taught there can be that let me be that can be that, of course we are getting closer, but now we have to play this game, we have to figure out and we have to think that let's try to make something a bit. Often, let's try to think that it is going along the lines of encryption and that too using zord.

A

Now this I know I'm stretching my head, I'm sorry for that, but uh agents need to scratch head and there is a property observed.

A

You know that property as well. I mean we all need to know. We all need to learn this today, but there is one interesting property also that what's encrypted with sore can be different. If it's all, I don't know why it sounds like what happens in vegas stays in vegas, but uh let's come back to his or let's come back to los angeles. I wish I could have been there, but what's encrypted with this or can be detective resort. This is good. This is good. This is good. This is good.

A

This is good, but for text what next there's still something that we need to know like? We know that it's encrypted it's hex code, it's encrypted using zor and we have the property absorber. We just need to do the same and we are going to explain it later on, like how we are going to solve it, but this gives us an hint very big hint.

A

There is another interesting fact: our investigative and research team has found out this interesting fact and if you look at e t a o, I n s h r d, l. U I mean, I don't know how to pronounce that we are going to use this now. What is this? This is another encryption problem. No, this is not an encryption problem. This is not any question problem.

A

This is one of the most interesting facts I mean, I hope, approximate facts, that this is the approximate order of 12 most used letters in english language, meaning making meaningful words, so the frequency of letters appearing like e would be more than t and then t would be more than a four more than I and and so on, and we have our data set team collected frequency for every every every letter, uh how they play an important role, making meaningful words in english standards. We have this frequency, we have. We know that it's hex code.

A

We know that it's interpretation is all. So what are we waiting? For? I mean we are getting closer, aren't we? I mean it's going too quick, but we have 30 minutes. We have to be quick. We have to the agent has to solve this mystery quickly. You will have to help us okay, so I mean let's go for it. Of course we are in the 21st century. Now we are not going to solve it manually with pen paper. We are going to build an application, but how do we?

A

How are we going to build that application? What language we are going to use?

A

Let's go for it golan. We are going to use poland. I mean this talk is revolving around golang, of course, but we are not coming directly to golan, also because we're solving a mystery right, yeah. Of course we are solving a mystery. We need to go back and let's build something and go line. So what will happen now now? If you look at this page, this page has an encrypted code, and this encrypted code is nothing but the code that was written in that script.

A

In that memo we have that now we need to go and code and fill the decrypted message here. We need to do that to find the treasure okay, where it is, and this looks so so complex- I mean really painful to the eyes. We need to fix that part, but before we fix that, we need to figure it out.

A

First, uh I mean one thing like: how will this our property work and how will we are approached to solve this problem before we move on to coding it so follow me, let's follow the agent so now, if you look at this photo, this photo is very very you know. You know it gives you a little bit idea, but how encryption happens? We are not going to talk about description here. We are going to use the reverse logic here. We are going to first encrypt something something that is written in alphabets into characters.

A

Now, here's there is an encryption key, and this is 69. Okay, and I mean let it be this encryption key. I mean you know, there's another interesting fact that this is a byte okay. So all this encryption key is also a buy, so a byte can have how many possibilities 256.

A

We are going to use that also as in fact, so that is another investigative analysis right now. Okay, so this means that the range of values can be at the max to 56. So at the max 256 encryption keys can happen right right.

A

So for now we assume that the encryption k69, although in our code it will be figured out on another one and we'll discuss it later. How? But if we see that a is 97, okay, small, a has its you know in the form of by just 97 and when we absorb it with 69, it becomes 36 and 36 is a dollar.

A

So now a has become dollar similarly b has become.

A

This is single code, and this is ampersand. This is estimation. So if we look at that code, it is very much possible that this is not directly alphabet, but they are, in fact you know their bytes only when they with these x code. This is x code, of course, but when these hex code will be converted into bytes, we will have them in this component. We will have them in this form and then we will try to sort them with how how will we sort them?

A

How will be finding that encryption key you'll find that, with the help of this e t, a y and srdlu okay, we are going to use this fact. This fact- and this mapping will help us get the information here and we are going to use that in the form of a score.

A

Let's go back, let's go back, let's go back, we are getting close, so this is single byte storage. This is how encryption is happening. That said, that done, we know that this was a little bit of reverse to what we wanted. This was encryption, but we want description, but now, let's come how to solve this so loop through all possible bits. Okay, if we loops like we can use brute force here, we don't have, you know a long set of values, so we can use this no smart.

A

uh I mean this is something, but of course we are going to use. We are going to leap off loop through all possible bytes and we are going to sort the byte against each bite of our encrypted food. Why? Because that is what being done here this and that was the property absorbed.

A

It will be like encrypted message will be here and it will be zord with something, and then we will be getting original message. The message that was being tried to figure out so whenever you see in the form of code, we might be seeing it better, but we will be looping through all all the possible rights to be zoring the bite against each wide of our encrypted code, and we need a score because we don't have now directly the encryption key.

A

We are going to assign spring a score based on the mapping mapping of what happening of the frequency table. We are going to see that frequency table in that code and what is that frequency all about that frequency is all about how letters come up in english alphabet and this the string that will be returned with the highest score will be a different message.

A

How is it sounding fun? Sounding fun, sounding fun sounded fun. Let's go code. Let's learn, go live now enough of slides enough of all this. Now I think we should code so, okay before we switch the screen, let's switch the screen and yeah of course. So what are we going to do now?

A

Yes, now we are going to study the code. We are going to see how this has been implemented in the form of go code. We will try to understand at least a little bit of golang. If not, you think, because it's not possible to be honest, we can have everything. So, let's go to code, let's learn how we are solving this interesting problem and how we're getting the output okay. So let me share the screen and let's go: let's go okay, so here we are now.

A

If we see this is the main program that we have written, then the file name is main dot go because this is the golan code. And now we need to study how this code works, how how it is going to implement whatever we have discussed till now. So uh I mean, let's start from the beginning itself. Now: first thing that you see is a package name. So package is basically you know a way to group functions and golang has this. uh You know important utility, it's one of the founding.

A

You know, stones of golan like package can be called because it it is. It is made up of all the files in the same directories and it helps in you know, grouping functions, so its features and its implementations will become more and more important when we think deeper in golang, from the resources that we are going to discuss about.

A

But for now we can see that this package main is important, because whenever we are going to execute a main, uh whenever we, whenever the main function every time the main package is executed, this function will be you know it will be called and from here whatever is being called, you know it will be working for our uh purpose, our goal so like.

A

If we see like this function main function, it will be the first thing to be called in from main it will be calling singles or the shipper which is written here, which we'll be discussing from single discipline. We can see that the code hex is being called and get car weight is being called. What are these we'll be discussing shortly, but you, as you can see, these are the functions that have already been written and how the parameters are being passed. We are going to discuss how they are go line specific.

A

So now, if you see line number nine, this is function decode hex. So, as we mentioned, we need to decode the hex code. We have the code in the form of hexadecimal, so hex have to be converted into the form of bytes array. So how is this function being written in golang? Let us check it out so function: decode hex, x, bytes by byte command. Oh my god. What is this? So?

A

Actually, if you see this is just the function name, the code hex, okay- and this is the value that you are going to pass uh the variable okay. So here the variable is of ty is this: is a slice or area of bytes? Basically, okay, so we need a byte array, so we are also passing a byte area as hex code. Okay. So this is the hex bytes and what we are going to get.

A

We are also we are going to get the array in the form of bytes, but they will be converted into bytes right now they is, they are hex bytes. They are not hexadecimal like you are not passing hexadecimal directly here you have converted the hexadecimal to you, know bytes, and that will be decoded into the form of bytes, which will be uh which we will be getting where you will be getting in. This variable called ret return, so this will be having the decoded byte setting okay.

A

So here we are dynamically allocating using make a memory to deter to ret and it will. Its memory will be equated equal to the length of x bytes, which is also being decoded. The length is also being decoded, as you can see, x, dot, decoded length, length, hex files, so this is something uh you know. This is just dynamic allocation of byte array that is happening here and now in the next code.

A

We can see that here an underscore is being written, underscore is written in gold and when we don't want to use when something is being returned, but it's not going to be used, so we did an underscore that gives us an option. You know to just you know. If something is being returned, we don't want to use like it's going to return. You know int and error, so decodes, sir into uh length of bytes returning the actual number of bytes written to destination, and it also I mean, returns the error.

A

But if we look at this thing, ret rtt, since it is dynamically allocated already and whenever we decode it it's already getting- you know passed inside red, so it is happening internally. We don't need anything else, so we are going to return ret after this. So what will ret contain? Rit will contain the bytes array this. This hex code that we got in the form of bytes array was decoded.

A

Okay, it was decoded and it was deported and it has been stored in rdt and it will be later on called, but it's not being called here. Of course, it's being called in single sort decipher, but before we come to that, let's check it out what what we need to do next.

A

We also need a mechanism to calculate the scores, because we know that we have to find the highest score and the highest score string and the high and the bytes that we will get with the highest score will actually, when converted to string, will be the answer that we need. Okay, so that is the answer that we need. That is the treasure hunt. We will be needing. So if you look at this okay, so now, if you look at this, this is just getting you know.

A

This is what we talked about: eta or srw, so minus negative team has, you know, covered all these data and if we see what is this, this from what is happening in line number 21 to a line number 14, it's nothing, but actually mapping of all the alphabets as keys to their values. And what is these values? These values are frequency frequency of their order of the frequency of their appearance, approx of alphabets, making meaningful english words.

A

So if we see like e, should have the maximum and it is having the maximum and then t is having nine. Similarly, it's all following this order. So this this data is something that is available on the internet. We can get it from there and I have also used the same, and it is what what is it returning? It is returning.

A

uh You know it's returning.

A

The weight of the score according to the corresponding key, so whatever key key, is also a form of fight. We discuss encryption key is nothing but a byte itself, so here we are getting the key in the form of care byte. So whatever you know key is we have. We will return the float value to that okay, so this is returning, basically, the value value of the alphabet that is coming from here. The key the key will be passed from this score: single georgia sector, okay.

A

So this is getting a key here in the form of care, byte and character, and this is all the type byte okay and it is going to return off.

A

It is going to return the frequency which is of type float64 okay, so because it is a float variable, it is delta has decimal places, so it is going to return of type 4.. So this is basically a hash map this. This is nothing but a map map of keys and values. Here the key is a b c d and we have converted it into the form of byte okay, so that they are mapped easily.

A

Now we have a mechanism to also calculate our scores, okay, and we have also the decoded byte array strings. We have two things now we need to just execute our algorithm, okay and we are going to execute here in this function.

A

What we are going to do here we are just going to you know we are just passing the encoded message in the form of array of bytes and what we will be returning will be returning the answer in the form of bytes the answer, the decrypted code- and this is this- the maximum score which we are returning, but we won't be using for now, because that's not what we want, and this was just for debugging in case we had a problem, but we didn't have- and this is an error by any chance that it happens.

A

Okay, so what is happening in line number 53 like number 50, just calling the function that we made here, decode hex, now what is happening here? This is getting the encoded message and it is decoding it in the form of byte array. Now we have the byte array now. What are we going to do? We are going to draw the each element in this bytes array with the 256 types, all the possible bytes. We have our 256 only so we are going to absorb them and store them in again an array of bytes okay.

A

So this c is nothing. uh You know.

A

No, it's not c. Actually, it's just being sold here, it's getting lowered and then we are getting. You know this r. This r is actually the array of bytes where we will be storing. You know uh the converted. Yeah, I mean the absorbed code. Okay. So whenever we are going to zor using the zor property, we are going to bite it again. We are going to solve it against its own bytes for all the possible values, all the possible values for all the possible values.

A

We do that and after doing that, what are we going to do that? We are going to. You know, use this c. Whatever will like we remember. No, when we were discussing that we were sorting it and we were getting a new form of character after zorin, because that will be a new white. So new word will be a new character and that character will be will there is a chance that it might be the answer so how to ensure that that chance is the highest by calculating the score.

A

So how will be calculating the score? We will be giving the string the score by using this function, getcar weight and there this here. Okay now this is happening like this is happening through a simple logic. We have declared a variable called variable s that will be having the sum because of the type float 64 okay, so it is of the type float 64 and what it is doing. It is getting the sum uh of each like it's going to pass through the entire bytes, so it has to calculate the entire byte array.

A

Some, no so just like you know, consider it when you, if you have ever like, if you have uh uh programmed uh or or declared an array and calculated the sum of all the limits in there. So we are basically doing that. Only just an additional step is that we are mapping it with here. So we are mapping uh the characters and passing them here and then we are adding the sum. After that, what is happening is we are storing that you know this character in the corresponding our resultant array of bytes.

A

Now, what we'll be doing after this all this happens, we are trying to calculate the highest score, because the highest scores will only be the corresponding string, because that will have the highest probability to be the english word that we wanted, so how to do that. That is also something similar that we you we might have done in other languages that we have done. uh It's just like calculating the maximum.

A

You know uh uh element of the array just like that, so we just want to calculate the maximum is score there. So now we we are getting the scores here. Absolutely that's right, but we have also variable score defined here in 1958 again, of course, 64 time now we are just finding the maximum of it. Okay. So if, if s is greater than score, then what will happen you keep on this means that does better.

A

So you keep on storing it in the answer, then you get the maximum score until as soon as you get the maximum score, it's done so where so, this and now, if you see that line number 73, it is getting the entire area. This is this is this was an array and we are just declaring. We are just assigning it directly. You know to r, because we need you know, because we need the entire array.

A

So this is something that we can do here and we need- and we have done after doing this, what are we going to return? We are going to return this answer the score and the error. Okay, and in this case,.

A

Okay and after this, what will happen is like if we see this function main function, this main function. We are calling this singles or the shifter code that we have implemented so now, if we go to this code, things will become little more clear. I will try to repeat now what is being done. This is the treasure code that we had. This is being passed in singles or the shifter function.

A

Okay, and what are we going to get? We are going to get the answer. The answer is in the form of byte array, so we are just converting it to the form of string here when we are trying to use fmt now, fmt was declared here, as you can see. So what is its purpose? Its purpose is basically to print it to format it in the console.

A

So we are going to use that fmp document here and decrypted code is the form of string answer so overall, this is the code that we wanted to implement now if we go and check it out like how it has been done. So if we see again singles out the shepherd function, it calls this uh singles or deceptive calls.

A

The code has if they put the hex coded byte message after decoding it maps with the weight map that we have created and keeps on adding the sum and fine and on finding the maximum sum we map it with the corresponding uh bytes and then that byte will be the answer, those those those that are bytes, which we converted into the form of string. So enough of all this now it's time to run this program. Okay, now just just see that what does it does? Okay, so, let's run using go, run main dot, go.

A

Wow, so the answer is decrypted code is welcome to kubecon plus cloud native north america 2021., oh my god, so that that was a treasure.

A

That was our treasure and now let's go back to our slides and see how far we have reached so so so so so so, let's go back to our slides here we are so on building in golang, we found out that an encrypted code had nothing else with the treasure that we are severing today. The present that we have today welcome to kubecon plus cloud native conference, north america 2021.

A

The link to implemented code is in this slides, but now I know that this is not just enough. This is just the beginning. In fact, we have just covered a very you know, interesting point of view of golang. I would not say that this tutorial or this workshop or this stock will tell you everything about golan. This was not intended. Actually, this was just to give you the torah of you know: resources as well as the first interest on how to move ahead with it. So the agent nj has done his job.

A

He will remove his glasses, or maybe later only first, let's figure out what else is left. So installing golang is something that I have already mentioned here. These resources please go and check out according to your operating system, you can install it and why we use golang, I mean one of the biggest advantages of golang is that is built for confluency and it's easier to learn. It's learn to learn.

A

It has been adopted by many and used by many cloud native technologies like communities and they use it because because it is built for confluency so and many other features that we have like, like the you know, the kind of the package dependencies handling it that we do with go mod. When people go in detail, we will discuss this later. There are other responsive resources that I have shared with you all to learn. Go line because learning go land will be requiring you know a little bit of time.

A

It will take time, but don't worry you all will learn you all will enjoy about it and uh with this I would like to end my talk and this talk that we had, and I hope that you enjoyed this journey with asian bhutan to discover the treasure. The treasure is today this conference.

A

Thank you so much for coming out. If you want to reach out to me, reach out to me on twitter at meteorj94, if you want to reach on me slack on communities back, my name is just between jay. You can reach out to me there don't just end here. We are here to have you. We are here to help you out and if you have any questions, let's discuss, let's try to solve them. Let's try to help you out. Thank you so much for joining. Thank you so much everybody.