Answered step by step
Verified Expert Solution
Question
1 Approved Answer
This is the fourth phase of my binary bomb lab. Need to find two numbers move on to the next phase. So far, I've managed
This is the fourth phase of my binary bomb lab. Need to find two numbers move on to the next phase.
So far, I've managed to find that the second number is 24. I've looked at other examples of this problem and they all either require only one number or they have a constraint on what the first number can be, 0-14,but as far as I can tell, I have a constraint of 0-2.
When I've input all the different cominations [0,24],[1,24],[2,24], they aren't correct so I've looked into function func4, but I can't figure out what the recursive function is doing.
Dump of assembler code for function phase_4: $0x2c, %esp 0x1c (%esp), %eax %eax, 0xc (%esp) 0x18 (%esp), %eax %eax, 0x8 (%esp) sub lea mov lea mov mov! $0x804a5e1, 0x4(%esp) mov mov call 0x80489101soc99 sscanfeplt> cmip jne 0x8048ddaStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started