×

Buffer overflow attack with examples

You have undoubtedly faced the term buffer overflow in your programming journey. Many times it occurs when we try to run a piece of code with user input, but it gives some error like stack buffer overflow or heap buffer overflow or something like segmentation fault. So, let's try to understand this topic.

What is Buffer?

When we run a program, particular types of memory are used to store data and the program also. This memory is called a buffer. Buffer lives in RAM. It is a sequential section of memory to contain anything from character strings to integer numbers. Buffer improves the performance of a computer.

What is Buffer Overflow?

Some programming languages like C and C++ allow the programmers to allocate memory for the buffer. When a user puts an input beyond the memory of the buffer, inputs are stored nearby memory or buffers, which is not allowed. It happens because the programmer has not used anyway to check the input. Some built-in functions of C and CPP languages are also a way to create buffer overflow.

Example: -

Let’s take a piece of code as example

#include <bits/stdc++.h>
using namespace std;


int main() {
	vector<int> arr(2,0);
	arr[0] = 5;
	arr[1] = 6;
	arr[4] = arr[9];
	return 0;
}

Here firstly, we declare a vector arr of size 2. But after that, we are trying to allocate some data in arr[4]. As there does not exist any memory location for it so, there will occur buffer overflow because the information should be stored for this purpose; we need to modify the nearby memory.

Types of buffer overflow: -

Stack buffer overflow: Stack is an integral part of programming. In memory allocation of buffer, the stack is used. When we call a new function, a stack is created for that purpose. When the overflow occurs in the function, it is called a stack buffer overflow.

Heap buffer overflow: When overflow occurs in the open memory pool, it is called a heap buffer overflow.

Integer Overflow: This type of overflow frequently occurs in our programming practices. When we take two integer type values and multiply them and try to store them in an integer type variable, it causes an overflow.

Some Results of Buffer Overflow: -

  1. It causes the update of a memory location that is unwanted and not permissible.
  2. It may crash your system.
  3. It also creates a way for attackers to manipulate the private data.

Buffer Overflow attack: -

Buffer overflow is the weak point of any app or programmed system. Attackers target this point and manipulate the code. For this reason, a big problem in cybersecurity arises.

Example: In 2014, a cyber threat named "heartbled" was exposed to hundreds of millions of users due to a buffer overflow in SSL software.

The way of attack: -       

When attackers find buffer overflow, they try to inject their shellcode into the main code to manipulate the program. There are different parts of this malicious content which control the data. The parts are as follows:

  1. A chain of bytes which represent NOP instruction ( programs that are not executable).
  2. A new return address which points to the NOP bytes.
  3. Arbitrary code is located somewhere in the middle of the chain of bytes.

Types of Buffer Overflow attacks:

Stack buffer overflow attack: It is the most common buffer overflow attack because it is very easy. Here call stack is used.

Heap buffer overflow attack: When an overflow attack occurs in the available memory pool, it is called a heap buffer overflow.

Integer Overflow attack: When we take two integer-types values and multiply them and try to store them in an integer type variable, it causes overflow. It also may result in an attack.

Prevention methods: -

  1. Selection of language: Many programming languages are prone to buffer overflow, but the limit of such attacks varies on the language that is used to write the vulnerable program. Code written in Perl or JavaScript or python is generally not vulnerable to buffer overflows. Buffer overflow in a program which is written in C, CPP, Fortran or assembly could allow the attackers to compromise the targeted system fully.
  2. Use of safe library and functions: In many cases occurs because of using library functions which do not check any boundaries. Functions like gets, printf, scanf and strcpy are of this type. So, it is highly recommended not to use this type of library or function.
  3. Testing: It is one of the suitable measures to prevent buffer overflow. We can find the faulty code and patch the bug by edge testing. It is an advantageous method in software which are under development process.

Note: We can also use the methods like deep packet inspection, address space layout randomization, Executable space protection, Buffer overflow protection etc.


Related Topics

Bubble Sort in Data Structures

Bubble Sort in C++ The bubble sort algorithm analyses two adjacent elements and swaps them until they are no longer in the desired order. Each iteration moves each member of the array...

4 minutes read.

Deletion Operation from A B Tree

This article will show the deletion operation through the b tree in C++ programming language. Implementation #include <iostream> using namespace std; class B_TreeNod {   int *kys;   int m;   BTreeNod **C;   int j;   bool leaf;  ...

5 minutes read.

Complete Binary tree

In this article, we will discuss the complete binary tree. But before start discussing the complete binary tree, we should first see a brief description of a binary tree. What is...

7 minutes read.

Create a binary search tree

Implementation In this section of the article, we will see the usage and mechanism of how we will create a given binary tree. Let's observe these in more depth and then...

7 minutes read.

B Tree in Data Structure

Data management is called database management. A data model is a system that stores, manages, and optimizes computer resources. Data processing is not just about data storage. Almost every app...

9 minutes read.

Red-black Tree in Data Structures?

A type of binary tree which is known as the Red-Black tree, is a specialized and unique tree. What is the urgency or, to be more precise, the necessity of...

10 minutes read.

Binary Search

Binary Search: When there is a large data structure, the linear search takes a lot of time to search the element. The binary search was developed to overcome the lack...

7 minutes read.

Data Structures Algorithms

What is an Algorithm? An algorithm is a sequence of steps used to complete a job or get a desired result. It is similar to programming building elements that let cell...

4 minutes read.

Tim Sort

Tim Sort is a mixture stable arranging calculation that exploits normal examples in information, and uses a mix of an improved Merge sort and Binary Insertion sort alongside an interior...

6 minutes read.

About Data Structures

What exactly are data structures? A data structure is a type of storage that is used to organise and store data. It is a method of organising data on a computer...

5 minutes read.

Types of Data Structures

Almost every programme or software system that has been built makes use of data structures. Furthermore, data structures are basics of computer science and software engineering. When it comes to...

7 minutes read.

Burning binary tree

Burn the Binary tree starting from the target node You have given a binary tree and a target node value. Now you have to burn the tree from target node. You...

4 minutes read.

Recursion - Factorial and Fibonacci

In this article, we will learn how to find the factorial of a number and the Fibonacci series up to n using the recursion method. What is recursion? Defining anything in terms...

7 minutes read.

Splay Tree

Splay Tree A splay tree is a self-balanced or self-adjusted binary search tree. We can say, Splay Tree is used in some cases where some elements or data are accessed more...

8 minutes read.

DFS (Depth-first search) Algorithm: Data Structure

What is DFS (Depth-first search)? The depth first search is a graph traversal algorithm. The idea behind this algorithm is backtracking and it is a kind of recursive algorithm. In the...

3 minutes read.

Bubble sort algorithm using Javascript

Sorting is a very useful technique in many algorithms and programs. Basically, sorting operations help us to arrange a set of data in a particular manner. Bubble sort is one...

3 minutes read.

Stack vs Queue: Data Structure

 Difference Between Stack and Queue What is Stack? The LIFO principle applies on insertion and deletion operations of the stack which means last inserted element to the stack will remove first....

3 minutes read.

Implementation of stack

Implementation of stack: The stack can be implemented in two ways: using array and using a linked list. The pop and push operations in the array are simpler than the...

3 minutes read.

Partitioning a linked list around a given value

Partitioning a linked list around a given value In this problem, we are given a linked list and a value k. We need to partition the given linked list so that...

3 minutes read.

Data structure: Infix to Prefix Conversion

Infix to Prefix Conversion In present time, we use the infix expression in our daily life but the computers are not able to understand this format because they need to keep...

4 minutes read.