Hello and welcome back.
Before we jump in to trying to solve crime meter Dean let us first examine the strategies data available
to us as you can see in this slide.
There are three ways in which we can approach the crime rate in the first way is the easiest to do and
it does not require you to unpack the file.
So in this method you will hide in a debugger from the program using killer height or idea plugins and
then you will create a loader using the two and then you will bash hero key in the process that is running.
So this method is very useful if you are unable for whatever reason to unpack defined.
So the second rule is use if you can find me or be the original entry point or in entry point.
If you recall easy entry point of the father he's inside the paper section so finding it will be sometimes
may not be so straightforward.
So in those cases where you are able to find your B then you cannot use the second way.
If you used the first order.
So assuming that you then find your AP and then he will not try to unpack it by dumping the unpack file
and then trying to fix your I.D. and sometimes fixing I.T. is not so easy.
So if you are unable to face i.e. table then the secondary cannot be used.
So you'll be left with your first order but assuming that you are able to successfully unpack file then
you can go ahead and bash the father has me unpacked.
So it is known as file patching and here I would like to emphasize the difference between process patching
and file purging in process patching.
You are not patching any files in the at all you are actually patching the memory the RAM memory and
this is also known as runtime paging however in the second movie Ray you are using the unpack file to
patch you are actually patching your files so.
So what's the difference between process and file processes where a program has been loaded into memory
so before a program runs serious in the hand disk and it is known as a file so before file can run he
has to be loaded from the had this into memory and then only you patching the process.
So this is done using Lotus but are we here we are patching a file so you're not patching the memory
here patching a file.
So this would be different.
And then the third method is the most difficult of all because the third method is where you are trying
to figure the zero key so and it may not be so easy especially if this year a key is a January 10 using
some complicated method or what is known as complicated algorithms.
So now I'm going to start off the next lesson by going through the first method first and then we'll
proceed with second and then we in the subsequent lessons.
So that's all for this lesson.
I'll see you in the next one.
Thank you for watching.