Haseeb-Qureshi

uber_slack

Uber-Slack integration

algorithms-practice

You know what it is

Algorithms-Study-Group

Study group for algorithms in Ruby, hosted at App Academy

Asteroids

JS and HTML5 Canvas

crypto-challenges

Matasano's Crypto Challenges in Ruby

cs-fundamentals

The CS Fundamentals Series

lets-build-a-blockchain

A mini cryptocurrency in Ruby

n-queens-visualizer

Visualizes solutions to the N-Queens problem, written in React & Flux

p2p_assignment

Ruby-Chess

Chess (written in Ruby)

Haseeb-Qureshi/lets-build-a-blockchain

A mini cryptocurrency in Ruby

Haseeb-Qureshi/n-queens-visualizer

Visualizes solutions to the N-Queens problem, written in React & Flux

Haseeb-Qureshi/cs-fundamentals

The CS Fundamentals Series

Haseeb-Qureshi/algorithms-practice

You know what it is

Haseeb-Qureshi/crypto-challenges

Matasano's Crypto Challenges in Ruby

Haseeb-Qureshi/p2p_assignment

Haseeb-Qureshi/blockchain

A little mini blockchain

Haseeb-Qureshi/ruby-dht

Distributed Hash Table with consistent hashing, implemented in Rack servers communicating via HTTP

Haseeb-Qureshi/advent-of-code-2021

Haseeb-Qureshi/c-practice

Haseeb-Qureshi/that-time-i-cracked-my-reddit-password

That time I used Ruby to crack my Reddit password (kinda) — talk

Haseeb-Qureshi/99kittens

Live Rails App for renting kittens

Haseeb-Qureshi/advent-of-code-2018

https://adventofcode.com/2018

Haseeb-Qureshi/advent-of-code-2019

Haseeb-Qureshi/advent-of-code-2023

Haseeb-Qureshi/google-10000-english

This repo contains a list of the 10,000 most common English words in order of frequency, as determined by n-gram frequency analysis of the Google's Trillion Word Corpus.

Haseeb-Qureshi/haseeb-qureshi.github.io

This is the source code for my site, haseebq.

Haseeb-Qureshi/raft

Implement the Raft algorithm over multiple threads in Ruby

Haseeb-Qureshi/advent-of-code-2020

https://adventofcode.com

Haseeb-Qureshi/amoveo

A blockchain for trust-free markets in financial derivatives

Haseeb-Qureshi/ml-practice

Haseeb-Qureshi/podrabbit

For Rabbits who Podcast

Haseeb-Qureshi/advent-of-code-2022

Haseeb-Qureshi/advent-of-code-2024

Haseeb-Qureshi/lies-damned-lies-and-substrings

Lies, Damned Lies, and Substrings (Talk)

Haseeb-Qureshi/MD4-Collision

MD4 Collisions MD4 is a 128-bit cryptographic hash function, meaning it should take a work factor of roughly 2^64 to find collisions. It turns out we can do much better. The paper "Cryptanalysis of the Hash Functions MD4 and RIPEMD" by Wang et al details a cryptanalytic attack that lets us find collisions in 2^8 or less. Given a message block M, Wang outlines a strategy for finding a sister message block M', differing only in a few bits, that will collide with it. Just so long as a short set of conditions holds true for M. What sort of conditions? Simple bitwise equalities within the intermediate hash function state, e.g. a[1][6] = b[0][6]. This should be read as: "the sixth bit (zero-indexed) of a[1] (i.e. the first update to 'a') should equal the sixth bit of b[0] (i.e. the initial value of 'b')". It turns out that a lot of these conditions are trivial to enforce. To see why, take a look at the first (of three) rounds in the MD4 compression function. In this round, we iterate over each word in the message block sequentially and mix it into the state. So we can make sure all our first-round conditions hold by doing this: # calculate the new value for a[1] in the normal fashion a[1] = (a[0] + f(b[0], c[0], d[0]) + m[0]).lrot(3) # correct the erroneous bit a[1] ^= ((a[1][6] ^ b[0][6]) << 6) # use algebra to correct the first message block m[0] = a[1].rrot(3) - a[0] - f(b[0], c[0], d[0]) Simply ensuring all the first round conditions puts us well within the range to generate collisions, but we can do better by correcting some additional conditions in the second round. This is a bit trickier, as we need to take care not to stomp on any of the first-round conditions. Once you've adequately massaged M, you can simply generate M' by flipping a few bits and test for a collision. A collision is not guaranteed as we didn't ensure every condition. But hopefully we got enough that we can find a suitable (M, M') pair without too much effort. Implement Wang's attack.

Haseeb-Qureshi/newsletterer

Haseeb-Qureshi/Number-Theory-Python

Python code to implement various number theory, elliptic curve and finite field computations.

Haseeb-Qureshi/odometer

Smoothly transitions numbers with ease. #hubspot-open-source

Haseeb-Qureshi/pairing-app

Manage Your Pair Programming Rotations