Bhaskar Kumar (@HaxonicOfficial)
github

HaxonicOfficial

Twitter logo Share LinkedIn logo Share Facebook logo Share
  • Stars
    star
    128
  • Global Rank 172,858 (Top 6 %)
  • Followers 267
  • Following 74
  • Registered over 7 years ago
  • Most used languages
    HTML
         30.0 %
    PHP
         20.0 %
    Hack     20.0 %
    Shell
         10.0 %
    C++
         10.0 %
    Java
         10.0 %
  • Location 🇮🇳 India
  • Country Total Rank 6,153
  • Country Ranking
    Hack     5
    HTML
         880
    PHP
         1,526
    Shell
         2,283

Top repositories

1

CTF-Practice

CTF problems for the practice of Beginners in Cyber Forensics.
Hack
38
star
2

Wish-Her

a demo website, which can be used to which someone special on special occasions like birthday, anniversaries etc
HTML
25
star
3

CyberSec_Resources

Get top quality resources from this repo. (Beginner Specific)
14
star
4

PHP-Based-Email-Spoofer

A Email-Spoofer demo, via which a attacker may use this social-engineering skills to retrieve sensitive data from the victim just by manipulating Email-headers.
PHP
6
star
5

Unreliable-Web

Vulnerable Pen-testing Lab for Web+Forensics+Crypto
5
star
6

Vulnerable-Web-App-For-Pentesting

Newbies at Penetration Testing can learn too attack real time web application and secure their community from attacks by finding bugs
Hack
4
star
7

Portfolio-Website

This is a Portfolio website webpage which is editable and open source :)
HTML
3
star
8

Make-RDP

Shell
2
star
9

Hacktoberfest-repo

Open Source is love!!!
HTML
2
star
10

Talks

All the content, notes, resources which were discussed during my Workshops/ Seminars/ Expert Talks will be uploaded here
2
star
11

HaxonicOfficial.github.io

1
star
12

PushupMotivation

Do your Push-ups We'll do the countings for you.
Java
1
star
13

UnSafe-Vault

This unsafe vault is a CTF Simulated Game that has inbuilt various vulnerabilities
PHP
1
star
14

bubble-sort-and-binary-search

From the concepts of Data Structures in CPP ( C++ ). using Bubble Sorting or (Bubble Sort) the integers in a array and printing them. After Sorting, Using Binary Search, searching the position of element . RUN this code in code blocks directly :p, OutPut comes like this , "Enter number of elements in array", then enter each element "Enter n numbers", then "the sorted list of numbers after bubble sort is x x x x". now enter number to find using binary search, it will show you the location of the number. :)
C++
1
star