Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
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

Technique 7 – call stack backtracing

The call stack is a relatively hard topic to understand, but it is very useful for speeding up your malware analysis process. It's also useful in the unpacking process.

Take a look at the following code and imagine what the stack will look like:

func 01:
1: push ebp
2: mov esp, ebp ;now ebp = esp
...
3: call func 02
...
func 02:
4: push ebp ;which was the previous esp before the call
5: mov ebp, esp ;now ebp = new esp
...
5: call func 03
...
func 03:
6: push ebp ;which is equal to previous esp
7: mov ebp, esp ; ebp = another new esp
...

You will notice that, just after the return address from call func03 in the stack, the address of the previous esp is stored. The previous esp value is stored in the stack. This stored esp value points to the top of the stack, just after instruction 5. On top of the stack from this previous esp value, the first esp value is stored (this is because of instruction 4...

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 €18.99/month. Cancel anytime