_ _ __ __ _ _
| | ___ _ __ __ _| |__ \ \ / /__(_)_ __ | |__ __ _ _ _ _ __ ___
_ | |/ _ \| '_ \ / _` | '_ \ \ \ /\ / / _ \ | '_ \| '_ \ / _` | | | | '_ ` _ \
| |_| | (_) | | | | (_| | | | | \ V V / __/ | | | | |_) | (_| | |_| | | | | | |
\___/ \___/|_| |_|\__,_|_| |_| \_/\_/ \___|_|_| |_|_.__/ \__,_|\__,_|_| |_| |_|
Binary Analysis | Algebraic Geometry | Cryptography
I am a Ph.D. student in Computer Science at Tufts University, where I study programming languages and computer security in the Tufts Programming Languages Research Group [TuPL], advised by Jeffery Foster. I received my Master's in Computer Science at Dartmouth College where I worked in the Trust Lab on projects relating to computer security and binary analysis. My Bachelors degree is in pure mathematics and computer science so I generally lean towards intersections of these two fields. I am a fan of the standardization and canonicalization of computer science curricula and theory, perhaps with a tinge of bias from my math background.
- A Census of Cubic Fourfolds over 𝔽₂ [link] [pdf] * Asher Auel, Avinash Kulkarni, Jack Petok, and Jonah Weinbaum
- Master's Thesis [presentation] * Jonah Weinbaum
- Undergraduate Thesis [link] [presentation] * Jonah Weinbaum
- Action This Day [github] [presentation] * Examining the permutation and probabilty theory that allowed cryptographers to best German encryption during WWII. New results in permutation theory allow for a more holistic analysis of the Bombe's efficacy
- SVMs with Geodesic Hyperspheres [github] * Developing theory and tools which allows SVMs to generalize to arbitrary Riemannian manifolds allowing for more accurate classification even with sparse data sets
- Plausible Cache Deniability for Spectre Attack Mitigation * Preventing Spectre and other side-channel cache leakage attacks by creating plausible deniability in cache hit and miss rates
I like to imagine what ideas would look like upon rediscovery. If a theory disappeared tomorrow, what would it look like in its recreation and reimplementation? Would we make the same choices and formalizations, or were such things only created out of the context of their time? I find that on reanalyzing old or "completed" ideas, that is, ideas that were stored in a box somewhere as a tool us computer scientists use, there is often more to be uncovered. The recipe of sifting through progress prior to its peak allows us to battle stagnation of ideas by imagining what these ideas would look like were we not outright told the solution.
- Teaching Assistant * Teaching assistant at Dartmouth College for - Compilers (COSC 57/257) * Aided in editing lecture and assignment material. Served as lecture assistant to answer questions for students regarding lectures and code for their assignments. - Hacklab: Binary Program Analysis for Software Attacks and Defenses (COSC 69.18/269.18) * Served as teacher for several lectures; created lecture materials, assignments, exercises, and exams. Developed a number of mock-CTF challenges in binary exploitation for exams centered around stack buffer overflows, format string vulnerabilities, ROP chains, and GOT/PLT overwrites.
- Game Hacking
- Hogwarp Mod for Hogwarts Legacy [link] [discord] * Developer for Tilted Phoques creating a mod bringing multiplayer to Avalanche Software's Hogwarts Legacy
- Skyrim Together Mod for The Elder Scrolls V: Skyrim [link] [discord] * Developer for Tilted Phoques creating a mod bringing multiplayer to Bethesda's Skryim
- Multiplayer Mod for Sonic Adventure 2 Battle * Currently working on a passion project to bring splitscreen multiplayer to Sonic Adventure 2 Battle
- University of Michigan's 2020 DRP [presentation] * Presentation on the fundamental group of the circle
- Tutoring * Tutoring for high school students in mathematics, physics, and chemistry. Create unique lesson plans to aid students in completing exams and assignments.
- The image listed in the header is a portrait of myself and took roughly 300 man-hours to produce