<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>infinitymdm.dev</title><link>https://infinitymdm.dev/</link><description>Recent content on infinitymdm.dev</description><generator>Hugo</generator><language>en-us</language><copyright>2026 Marcus Mellor</copyright><lastBuildDate>Wed, 27 May 2026 13:49:06 -0500</lastBuildDate><atom:link href="https://infinitymdm.dev/index.xml" rel="self" type="application/rss+xml"/><item><title>Learning With Errors</title><link>https://infinitymdm.dev/blog/chipathon-2026/lwe-explained/</link><pubDate>Wed, 27 May 2026 13:49:06 -0500</pubDate><guid>https://infinitymdm.dev/blog/chipathon-2026/lwe-explained/</guid><description>&lt;p&gt;Cryptography is mostly about finding math problems that are really easy if you know some hidden information, but impossibly hard if you don&amp;rsquo;t. Learning With Errors is one such problem.&lt;/p&gt;
&lt;!-- more --&gt;
&lt;p&gt;This article is a brief introductory look at the Learning With Errors (LWE) problem, which is the foundation of many developing cryptosystems. I&amp;rsquo;ll try to make it as digestible as possible. But be forewarned: here be equations.&lt;/p&gt;</description></item><item><title>I'm Participating in a Chipathon!</title><link>https://infinitymdm.dev/blog/chipathon-2026/fhe-project-announcement/</link><pubDate>Tue, 26 May 2026 11:03:50 -0500</pubDate><guid>https://infinitymdm.dev/blog/chipathon-2026/fhe-project-announcement/</guid><description>&lt;p&gt;This summer, I&amp;rsquo;ll be taking part in the &lt;a href="https://sscs.ieee.org/technical-committees/tc-ose/sscs-pico-design-contest/"&gt;IEEE SSCS &amp;ldquo;PICO&amp;rdquo; Chipathon&lt;/a&gt;!&lt;/p&gt;</description></item><item><title>CharLib Part 2: How it Works</title><link>https://infinitymdm.dev/blog/papers/charlib/operation/</link><pubDate>Tue, 07 Jan 2025 14:16:52 -0500</pubDate><guid>https://infinitymdm.dev/blog/papers/charlib/operation/</guid><description>&lt;p&gt;Now that we understand standard cell characterization, we can actually look at the paper. As it
turns out, understanding the background is the hardest part here.&lt;/p&gt;</description></item><item><title>CharLib Part 1: Background</title><link>https://infinitymdm.dev/blog/papers/charlib/background/</link><pubDate>Wed, 07 Aug 2024 14:16:52 -0500</pubDate><guid>https://infinitymdm.dev/blog/papers/charlib/background/</guid><description>&lt;p&gt;Before we dig into the details of this paper, let&amp;rsquo;s cover some important information you&amp;rsquo;ll need to
understand.&lt;/p&gt;</description></item><item><title>About</title><link>https://infinitymdm.dev/about/</link><pubDate>Mon, 05 Aug 2024 16:11:01 -0500</pubDate><guid>https://infinitymdm.dev/about/</guid><description>&lt;h2 id="who-are-you"&gt;Who are you?&lt;/h2&gt;
&lt;p&gt;I&amp;rsquo;m Marcus Mellor. I&amp;rsquo;m currently a Ph. D. student and researcher at Oklahoma State University
studying computer arithmetic. My previous work was as a test engineer at a large government
contractor, where I designed tools to help people make better hardware. Before that, I studied
electrical engineering at Oklahoma Christian University.&lt;/p&gt;
&lt;p&gt;My goal is to make electrical and computer engineering more accessible to everyone. I&amp;rsquo;m a believer
in the power of open source and open hardware efforts; you&amp;rsquo;ll see me talk about those pretty often.
I&amp;rsquo;m a chronic tinkerer and a Linux enthusiast, though I admit I only know enough to be a danger to
my own computers. My hobbies include playing video games with my friends, reading (especially
science fiction), and using tools on things (hopefully constructively).&lt;/p&gt;</description></item><item><title>Surprise, it's a Blog!</title><link>https://infinitymdm.dev/blog/meta/welcome/</link><pubDate>Mon, 05 Aug 2024 10:18:02 -0500</pubDate><guid>https://infinitymdm.dev/blog/meta/welcome/</guid><description>&lt;h2 id="hello-there"&gt;Hello There!&lt;/h2&gt;
&lt;p&gt;If you&amp;rsquo;re reading this, it means I finally started up that website I&amp;rsquo;ve been talking about for
ages. I&amp;rsquo;m just as surprised as you! I didn&amp;rsquo;t think I would ever get around to it, but here we are.&lt;/p&gt;</description></item></channel></rss>