HTTP is stateless, meaning each request is independent, with no memory of previous requests. For example, if you visit a website and add items to a shopping cart, the server doesn’t remember your c...
Cross-Site Scripting (XSS)
Type of injection attack where malicious scripts are injected in trusted websites, and executed by the visitor’s browser. Let us see a sample to understand a XSS security issue: <!DOCTYPE html...
Content Security Policy
Content Security Policy (CSP) is a security feature that helps prevent various types of attacks, such as Cross-Site Scripting (XSS) and data injection attacks, by controlling the sources from which...
Reverse Engineering 101
GETTING STARTED WITH REVERSE ENGINEERING ASSEMBLY BASICS CPU ARCHITECTURE: REGISTERS, MEMORY AND MACHINE CODE A GENERAL FLOW OF PROGRAM EXECUTION Program on Disk (EXE): The executable file (...
Secure Coding in C and C++ (Part 2)
SECURE CODING IN C AND C++ (Part 2) NEVER USE GETS Never use gets(). Because it is impossible to tell without knowing the data in advance how many characters gets() will read, and because gets() ...
Secure Coding in Java - OWASP TOP 10
OWASP TOP 10 VULNERABILITIES BROKEN ACCESSS CONTROL Broken access control allows users to access resources or functionalities they shouldn’t. This happens when the application fails to check user...
Security Tools
SECURITY ESSENTIALS NMAP Network Mapper (Nmap) is an open-source network analysis and security auditing tool written in C, C++, Python, and Lua. Scan Techniques root@96250515cfd7:/# nmap --help...
Secure Coding in C and C++ (Part 1)
SECURE CODING IN C AND C++ (Part 1) SIZEOF(ARRAY) In C/C++, when you pass an array to a function, it becomes a pointer to the first element. This means that sizeof(array) inside the function give...
Circular tour (geeksforgeeks - SDE Sheet)
PROBLEM DESCRIPTION Suppose there is a circle. There are N petrol pumps on that circle. You will be given two sets of data. The amount of petrol that every petrol pump has. Distance from tha...
Circle of strings (geeksforgeeks - SDE Sheet)
PROBLEM DESCRIPTION Given an array arr of lowercase strings, determine if the strings can be chained together to form a circle. A string X can be chained together with another string Y if the last...