Academia.eduAcademia.edu

Figure from:Buffer overflow: Mechanism and countermeasures

See full PDFdownloadDownload figure
The function present at the address space pointed by the RET will be executed next. Each such stack is reserved for every function, array or any sequential logical structure- stack, queue, etc. The loophole exists in the bounds of these. As the stack continue new information is being added down the stack leading to the growth of the stack but if the bounds aren’t checked, the stack can grow beyond the reserved memory, leading to the registers like RET getting overwritten. If the RET is overwritten with any other information, the stack won’t be pointing to the next address space for continuous execution and program crashes. Figure 2 explains this pictographic detail and simplicity.

Figure 2 The function present at the address space pointed by the RET will be executed next. Each such stack is reserved for every function, array or any sequential logical structure- stack, queue, etc. The loophole exists in the bounds of these. As the stack continue new information is being added down the stack leading to the growth of the stack but if the bounds aren’t checked, the stack can grow beyond the reserved memory, leading to the registers like RET getting overwritten. If the RET is overwritten with any other information, the stack won’t be pointing to the next address space for continuous execution and program crashes. Figure 2 explains this pictographic detail and simplicity.

Related Figures (2)

As illustrated in Figure 2, the stack continues to grow (stored information denoted as repeated alphabets) beyond the point of reserved storage and overwrites the RET, the program has no further instructions to execute and thence leading to crash. This could be disastrous for large-scale organisations. This vulnerability has no outsize limit, any size of the program could be brought down with just one extra byte of data in the most vulnerable and unexpected place. But this is not the worst-case scenario. Situations could get even severe from here.
As illustrated in Figure 2, the stack continues to grow (stored information denoted as repeated alphabets) beyond the point of reserved storage and overwrites the RET, the program has no further instructions to execute and thence leading to crash. This could be disastrous for large-scale organisations. This vulnerability has no outsize limit, any size of the program could be brought down with just one extra byte of data in the most vulnerable and unexpected place. But this is not the worst-case scenario. Situations could get even severe from here.
Fig. 3: Process in depth and simplicity of the stack
Fig. 3: Process in depth and simplicity of the stack