This reminds me of a bugfix [1] I added to nmap almost a decade ago, where runtime interaction was previously broken due to interaction with sudo and signal propagation. Was a fun rabbit-hole to figure out why the issue was happening.
I haven't had a chance to mess around with it much, but the coz-profiler [1] uses basically the same idea, but the other way around (i.e., slow down everything else to get a "virtual speedup") which helps quantify what the effect of optimizing some code would be.
I learnt about this tool from Emery Berger's talk [2] on this (at strangeloop), which I highly recommend. Lots of really nice insight, even outside of this tool.
Hi! It looks like I'd forgotten to update the CSS in one portion, due to this, on medium-sized screens, there was an overlap that occurred. This should be fixed now.
> If more than one contestant registers for a given category, the order of the contestants will be drawn at random. Based on the contestant order, the first contestant will be given an opportunity to attempt to compromise the selected target. If unsuccessful, the next randomly drawn contestant will be given an opportunity. This will continue until a contestant successfully compromises the target. The first contestant to successfully compromise a selected target will win the prize money for that target in that category. After a target has been compromised, the contest for that category is over and no other contestants will participate in the contest for that category (unless Sponsor has offered an additional winner option, which would be announced at the conference if applicable).
I still haven't been able to do complete code execution yet, but have reasons to believe it might be possible.
Simply using `x1` as input causes it to print "deadbeef11 is not defined". Additionally, parens are allowed, and there is the `=>` arrow syntax for defining functions. Thus, we have a way to define variables, a way to define lambda abstractions, as well as a way to perform applications. Therefore, we have the untyped lambda calculus. This is Turing complete, so I have reason to believe that it should be possible to execute arbitrary code. I just need to find some time to do so :)
Update: `(x1=>x1(x1))(x1=>x1(x1))` gives "Too much recursion" :D
A really nice outline by Prof Frank Pajares, can be found at [0] for people who might want to read through in a hurry. However, I personally would recommend reading the original text itself.
The RE101 and RE102 courses are created and run by Amanda Rousseau (Malware Unicorn), and she is amazing for giving back to the community constantly. I would definitely recommend following her on Twitter : https://twitter.com/malwareunicorn
The reason I bring all of this up, is since your typo "securedog" reminded me of (coincidentally) @malwareunicorn's 2 dogs : Malware Research Dog, and RE Pup. Absolutely adorable dogs :)
Yep, adding that option thing would be great. This could be done similar to the way giphy implements it at the moment. Also, guggy.com/slack doesn't seem to be working at the moment (along with the about page itself)
Additive and multiplicative can be moved between through exponentiation or logarithms. After that, yeah, using the Radon transform seems like a great idea.
My goal for 2017 is to get a _lot_ better at the fields of reverse engineering and vulnerability discovery (as well as showing PoC).
The plan of action: keep at it by attacking more wargames and CTF (capture the flag) contests. Also, I should probably try to consider bug bounties, to be able to orient the skills to real world problems as well.