Recently I’ve been in the process of building an offline repository of software for a project at work. The idea is that we’ll be able to completely install all required software completely disconnected from the Internet. When it got time to deal with containers…challenges abounded.
The act of attributing a cyber attack is a long sought after, but rarely attained goal. While things such as techniques, IP addresses, and other artifacts can plan an important role in attributing an attack, being able to attribute actions to a specific computer that has been obtained can help provide overwhelming proof of an act. In this post, I’m publishing a paper that I started working on a few months ago (life gets busy) that provides a forensic analysis of multiple freshly installed Kali systems. My goal over the coming months is to conduct similar experiments on other operating systems. I’ve also provided the raw data that I used to conduct my analysis.
For day 9, we’re trying to break a simple encryption scheme. Our input starts with a preamble of 25 numbers. From there, it continues with a series of additional numbers. Each number must be equal to the sum of any two of the previous 25 numbers. We’re trying to find the first number that doesn’t meet that rule.
Day 7 threw me for a loop. Basically what you have is a remake of the Matryoshka Dolls where you have a doll inside of a doll, only in this case it was bags within bags. We’re provided with a list of rules telling us which bags are within which bag. Ultimately we want to find how many bags can contain a “Shiny Gold Bag” within it.
So day 6 of Advent of Code was looking for you to help out a planeload of fliers with their customs forms. Our input file was a multi-line file where each line represented an individual person with groups separated by an empty line. To solve this problem, I decided to make use of the defaultdict function.
Once again, this year I decided to challenge myself to work on my python and complete The Advent of Code. My goal was to stick to each and every day, and for the most part, I was able to stick with that. Here is Days 1-5.
Over the last few months, I’ve begun to work with Ansible and have really begun to love it. It is designed to make configuration management for a single system or even an entire enterprise super easy to take care of.
This week marked an anniversary that most may not have observed. On Oct 1, 1969, a small team of engineers installed IMP #2 at the Stanford Research Center and the Internet was born.
So since this whole COVID-19 thing started, I’ve had a lot of free time on my hands. Yes, I’ve suddenly become a teacher (I’m taking care of my oldest, while Liz takes care of our youngest) but I am only working at the office one week out of every three. That gives me a lot of time. I decided among other things to work on my Python (a lot). So I went back to the 2015 Advent of Code and just started going away. So here are the first five days of the 2015 Advent of Code.
I’ve always found encryption interesting. While I’m not a mathematician I understand the basics generally. That statement mostly holds true when it comes to a symmetric encryption, but not so much when we start talking about asymmetric encryption.