Logo

Welcome to My Cybersecurity Journey

Studying the fields of secure systems, assembly code, and reverse engineering.

Despite my lack of practical experience, I have a strong desire to learn and a keen interest in this area. I enjoy breaking down software to get at the core of how it functions, which is why I find reverse engineering and assembly code so fascinating.

Mino Petrizzo
100% Security Focused
Ovo Snacks

Hey, I'm Mino! 👋🏼

I turn vulnerabilities into solutions.

Cybersecurity Enthusiast

Passionate about ethical hacking, secure coding practices, and reverse engineering. Always looking for vulnerabilities to patch and systems to harden.

Education

2022 - Now

Bachelor's in Computer Science

Specialized in Cybersecurity

2021 - 2022

IT Internship

1-year professional internship to complete middle school qualification

2018 - 2021

IT Middle School

Specialized technical secondary education in Information Technology

When I'm not coding...

Chess ♟️ Swimming 🏊🏼‍♂️ Biking 🚴🏼‍♂️ Gaming 🎮
HTML
<div class="responsive-container">
  <h2>Welcome</h2>
  <p>This is responsive HTML!</p>
</div>

Welcome

This is responsive HTML!

CSS
.hover-effect {
  transition: all 0.3s ease;
  padding: 10px;
  background: #f0f0f0;
}

.hover-effect:hover {
  transform: scale(1.1);
  background: #007bff;
  color: white;
}
Hover over me to see the effect!
JavaScript
function countDown(from) {
  let count = from;
  const timer = setInterval(() => {
    if (count <= 0) {
      clearInterval(timer);
      return "Blast off!";
    }
    count--;
    return count;
  }, 1000);
}
Python
def fibonacci(n):
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    elif n == 2:
        return [0, 1]
    
    fib = [0, 1]
    for i in range(2, n):
        fib.append(fib[i-1] + fib[i-2])
    return fib

# First 5 Fibonacci numbers
fibonacci(5)
[0, 1, 1, 2, 3]
Java
public class Encryption {
    public static String encrypt(String text, int shift) {
        StringBuilder result = new StringBuilder();
        
        for (int i = 0; i < text.length(); i++) {
            char ch = text.charAt(i);
            if (Character.isLetter(ch)) {
                char base = Character.isUpperCase(ch) ? 'A' : 'a';
                ch = (char)(((ch - base + shift) % 26) + base);
            }
            result.append(ch);
        }
        
        return result.toString();
    }
}
Original: Hello
Encrypted (shift=3): Khoor
PHP
<?php
function greet($name) {
    echo "Hello, " . $name . "!";
}

greet("World");
?>
Hello, World!
Assembly
; Simple x86 Assembly code to add two numbers
section .data
    num1 dd 10
    num2 dd 20
    result dd 0

section .text
    global _start

_start:
    mov eax, [num1]
    add eax, [num2]
    mov [result], eax
    ; Exit program
    mov eax, 1
    int 0x80
Result of 10 + 20 = 30

Contact & Chess Challenge

Can you find mate in 2?

White to move and win. Solve it to challenge me!