Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering Malware Analysis

You're reading from   Mastering Malware Analysis The complete malware analyst's guide to combating malicious software, APT, cybercrime, and IoT attacks

Arrow left icon
Product type Paperback
Published in Jun 2019
Publisher Packt
ISBN-13 9781789610789
Length 562 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Alexey Kleymenov Alexey Kleymenov
Author Profile Icon Alexey Kleymenov
Alexey Kleymenov
Amr Thabet Amr Thabet
Author Profile Icon Amr Thabet
Amr Thabet
Arrow right icon
View More author details
Toc

Table of Contents (18) Chapters Close

Preface 1. Section 1: Fundamental Theory FREE CHAPTER
2. A Crash Course in CISC/RISC and Programming Basics 3. Section 2: Diving Deep into Windows Malware
4. Basic Static and Dynamic Analysis for x86/x64 5. Unpacking, Decryption, and Deobfuscation 6. Inspecting Process Injection and API Hooking 7. Bypassing Anti-Reverse Engineering Techniques 8. Understanding Kernel-Mode Rootkits 9. Section 3: Examining Cross-Platform Malware
10. Handling Exploits and Shellcode 11. Reversing Bytecode Languages: .NET, Java, and More 12. Scripts and Macros: Reversing, Deobfuscation, and Debugging 13. Section 4: Looking into IoT and Other Platforms
14. Dissecting Linux and IoT Malware 15. Introduction to macOS and iOS Threats 16. Analyzing Android Malware Samples 17. Other Books You May Enjoy

Heap overflow vulnerabilities

Heap overflow vulnerabilities are exactly the same as buffer overflow vulnerabilities, except that they target variables that are allocated using malloc, HeapAlloc, or similar APIs. In this case, these variables are located in a pre-allocated space in memory that is called heap.

The heap doesn't include a return address or the address of EBP. However, all of the variables that are allocated (and the free spaces in the heap as well) are all connected via a linked list structure. After each data block, there's a pointer to where the previous item in the list and the next item are. Once the memory is freed, the free or HeapFree APIs follow these links and write the next item's address in the previous item's next entry, and the previous item's address in the next item's previous entry. The code will look something like this:

Figure 3: Sample code for the free function

By overflowing this variable, the attacker can overwrite FLink...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image