Breaking into 111 N Rengstorff Apt 2309

To get into my Facebook crib, I bruteforced a lockbox in two hours after traveling for thirty-six.

I don't want to sleep here tonight.

A closeup of the lockbox

I typed 0419 into the lockbox and it refused to open.

It's nearly midnight on Saturday and I just flew in from Bangalore. A fucking lockbox is keeping me from going to bed.

The Oakwood confirmation email lists some contact numbers. The managers office is closed. I dial the emergency hotline, and hang up after waiting on hold for a few minutes.

I don't have a car to sleep in, and can't climb into a third floor window. So if I don't want to sleep in this hallway I need to get in this box.

My suitcase unfortunately doesn't contain powertools, so I unpacked my laptop and connected to the wifi.

I learn my box is just a fancy version of what I've seen realtors use:

My box appears to be a fancy version of this

And crucially, order of the key presses doesn't matter. What does is the set of keys pressed between the last clear and opening. (1223==123==321)

Perhaps I can brute force this!

If Oakwood just gave me the wrong code or never reset the last guest's, then the correct code is probably 4 digits too. Also, lets assume for now that the correct code doesn't include a '*'.

Since the possibilities are every inclusion or exclusion of a button from the key-set, we look at the binary numbers from 0 to 2^10 containing four 1 bits. To make the list of possible codes, I the substitute in the indices's of the 1 bits:

# thanks SO for this handy one liner
get_bin = lambda x, n: x >= 0 and str(bin(x))[2:].zfill(n) or "-" + str(bin(x))[3:].zfill(n)
arr = []
for i in range(1024):
    g = get_bin(i,10)
    if (sum(map(int,list(g)))==4):
        print [i for i,j in enumerate(map(int,list(g))) if j>0]
        arr.append(g)
print len(arr)

There's gotta be a better way to do this.

210 possibilities.

30 minutes and a bruised thumb later, no cigar.

But wait...what if the code has a repeating digit! If a button is pressed multiple times, there will be fewer than 4 buttons in the solution set.

    if (sum(map(int,list(g)))<4):

To account for repeating digits

176 more possibilities.

Aaaand, click!

Finally!

Code "159". The 316th one I tried.

Worth it.

I followed up with Oakwood the next day, and the operator had no idea where the code "0419" came from. It's usually the last four digits of the confirmation number: 2629511. (9511==159)

It's gonna be a dope summer.

Note to self: Don't use a lockbox for your own shit