Skip to main content

A concept to a product (Kimidori [ 黄緑]) - Part 1

It has been 3.5+ years since I have taken a career break due to aging parents. Soon after my career break Dad passed away and Mom was detected with third-stage of throat cancer. I became a full-time caretaker of my mom. During the peak phase of COVID-19, I was daily visiting the hospital for her chemo and radiotherapy. The hospital wasn't willing to admit the patient due to COVID-19 fear. However, I continued my service in the hope that one day she will recover but after almost two years of battle I lost her. Life is seemingly strange to me. I was under the illusion that I can cure my mom. But divinity had a different plan. Her demise put me on a different level of thought process. I felt strongly nothing is really permanent in this material world. My mom told me that just before her demise, she possibly realized that her time is short and asked me to let her go as she was not able to take any more pain. She told me that 'sometimes losing somewhere, marks the beginning of winning a game somewhere else'. She passed away and I tried to get back to a job. Surprisingly, I was not getting calls due to a long career break. A few places (mostly mid-sized organizations) had cracked interviews but salary and market conditions post covid didn't make it fruitful. So, I gave up searching for a job in India and moved to the middle east. 

In the middle east, I met a wonderful person, she was a doctorate in computer science, and had a couple of months of interaction with her on the security aspect of the software. During our brainstorming, I started on a concept that led to a product (Kimidori [ 黄緑]) development. The development work is going on and I have started it as a tool for malicious URL detection but now it has grown in a few verticals to analyze a system and generate reports of various issues/parameters with the host environment, including securely hiding information in the host system. Currently, the target platform is Windows 10 and above. This is truly my baby.

The initial Screen looks like the below: 



After a URL Scan:





About: 





In 2nd Part will show a few more capabilities of this tool as well as new features getting added. (To be continued...)




Labels:

Comments

Post a Comment

Popular posts from this blog

XOR (Exclusive OR) for branchless coding

The following example shows the array reversing using the  XOR operator . No need to take any additional variable to reverse the array.   int main(int argc, _TCHAR* argv[]) { char str[] = "I AM STUDENT"; int length = strlen(str); for(int i = 0; i < ((length/2)); i++) { str[i] ^= str[length - (1+i)]; str[length - (1+i)] ^= str[i]; str[i] ^= str[length - (1+i)]; } cout << str << endl; return 0; } The above example is one of the uses of XOR but XOR comes in handy when we can do branchless coding  methods like butterfly switch etc. Sometimes this is very effective in speeding up the execution.  Let's see one of the uses of XOR in branchless coding. I am taking a simple example of Y = | X |.  Yes, I am generating abs of a supplied number. So, my function signature/definition in C++ looks like below: int absoluteBranch( int x) {     if (x < 0 ) {         return ...
1 comment
Read more

Power of Two

  I n this post will be discussing how to calculate if a number is a power of two or not. As an example, 8 is a power of two but the number 10 is not. There are many ways we can solve this. First , we will take an approach which is simple and iterative. In this case, we will calculate the power of two one by one and check with the supplied number. The below code illustrates it. bool isPowerofTwo(unsigned num) { auto y = 1; while (0 != y) { if (num == y) return true; if (num < y) return false; y <<= 1; } return false; } Second , assuming, the number is a 32-bit number, this is also an iterative solution. In this scenario, iterating all bits and counting the set bits. Any number which is a power of 2 will have only one bit set and the rest will be zeros. As an example, 8 in binary representation is 1000. Using this observation, we can implement an iterative solution. bool isPowerofTwo(unsigned num) { auto one_count = 0; for (auto index = 0; index < ...
Post a Comment
Read more

Reversing char array without splitting the array to tokens

 I was reading about strdup, a C++ function and suddenly an idea came to my mind if this can be leveraged to aid in reversing a character array without splitting the array into words and reconstructing it again by placing spaces and removing trailing spaces. Again, I wanted an array to be passed as a function argument and an array size to be passed implicitly with the array to the function. Assumed, a well-formed char array has been passed into the function. No malformed array checking is done inside the function. So, the function signature and definition are like below: Below is the call from the client code to reverse the array without splitting tokens and reconstructing it. Finally, copy the reversed array to the destination.  For GNU C++, we should use strdup instead _strdup . On run, we get the following output: Demo code
Post a Comment
Read more