Cross-Site Scripting Attack (XXS)
The Cross-Site Scripting Attack Let’s explore Cross-Site Scripting (XSS), one of the most common and dangerous vulnerabilities in web application security. XSS is a security flaw that occurs when ...
The Cross-Site Scripting Attack Let’s explore Cross-Site Scripting (XSS), one of the most common and dangerous vulnerabilities in web application security. XSS is a security flaw that occurs when ...
SQL Injection: When Data Becomes Code Introduction SQL Injection (SQLi) is one of the oldest yet persistently dangerous web application vulnerabilities. At its core, SQLi stems from a fundamental...
What is SSO (Single Sign-On) and Why is it Important? Today, we navigate through a multitude of applications and services. The number of services required for work alone—such as email, cloud stora...
What is SAML (Security Assertion Markup Language)? SAML is an open-standard protocol for web-based authentication and authorization. It is widely used to implement Single Sign-On (SSO), allowing u...
OpenID Connect (OIDC) vs. OAuth 2.0 A concept that is often confused here is OpenID Connect (OIDC). OAuth 2.0: Its primary purpose is Authorization. It determines answers to questions like, “S...
Here’s the English translation of the provided text: Authentication The process of verifying the identity of a user or process, such as with a login. The most common authentication methods ...
What is Active Directory (AD)? Think of Active Directory (AD) as a database (or directory) that stores information about company employees’ accounts, computer details, and policies you want to enf...
1. What is Backtracking? In a nutshell, backtracking is a strategy that involves exploring all potential solutions, but immediately abandoning paths that are no longer likely to lead to a solution...
Heap 힙은 최댓값 및 최솟값을 찾아내는 연산을 빠르게 하기 위해 고안된 완전이진트리(complete binary tree)를 기본으로 한 자료구조이다. 힙의 특징에는 최대힙일 경우 항상 부모가 자식보다 커야하고 형제간의 관계는 보지 않는다. 힙에서의 부모 노드와 자식 노드의 관계(index가 1부터 시작한다고 했을 때) ...
바이너리 서치 left = 1 right = n while(left<right): mid = left + int((right-left) / 2) if isBadVersion(mid): right = mid else: left = mid + 1 return left