The earliest memory I have of ‘programming’ is in the early/mid 90s when my father brought home a computer from work. We could play games on it … so of course I took the spreadsheet program he used (LOTUS 123, did I date myself with that?) and tried to modify it to print out a helpful message for him. It … halfway worked? At least I could undo it so he could get back to work…

After that, I picked up programming for real in QBASIC (I still have a few of those programs lying around), got my own (junky) Linux desktop from my cousin, tried to learn VBasic (without a Windows machine), and eventually made it to high school… In college, I studied computer science and mathematics, mostly programming in Java/.NET, although with a bit of everything in the mix. A few of my oldest programming posts on this blog are from that time.

After that, on to grad school! Originally, I was going to study computational linguistics, but that fell through. Then programming languages (the school’s specialty). And finally I ended up studying censorship and computer security… before taking a hard turn into the private sector to follow my PhD advisor.

Since then, I’ve worked in the computer security space at a couple of different companies. Some don’t exist any more, some you’ve probably heard of. I still program for fun too, and not just in security.

But really, I still have a habit of doing a little bit of everything. Whatever seems interesting at the time!

AoC 2016 Day 10: Bot Simulator

2016-12-10

Source: Balance Bots

Part 1: Create a sorting machine using input of the following form:

value X goes to bot A - an input to bot A
bot A gives low to (bot|output) B and high to (bot|output) C - a sorter that takes two inputs and sends them to the specified bots or output channels

Find the bot that compares the values 17 and 61.

AoC 2016 Day 9: Decompressinator

2016-12-09

Source: Explosives in Cyberspace

Part 1: A file is compressed by including compression markers of the form (#x#)... where the first number tells how many characters to copy and the second is how many times to copy them. So A(2x3)HA! becomes AHAHAHA!.

AoC 2016 Day 8: Tiny Screen Simulator

2016-12-08

Source: Two-Factor Authentication

Part 1: Implement a 50x6 pixel screen with the following commands:

rect AxB turn on a rectangle of pixels in the top left corner
rotate row y=A by B rotates row A right by B pixels
rotate column x=A by B rotates column A down by B pixels

After a given sequence of commands, how many pixels are on?

AoC 2016 Day 7: IPv7 Support Counter

2016-12-07

Source: Internet Protocol Version 7

Part 1: The input is a list of strings, potentially containing sequences in square brackets. Find all strings that have an ABBA sequence (two characters followed by the same two in reverse order) outside of any square brackets, but no ABBA sequences in square brackets.