<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Martin Bosslet&apos;s Blog</title><description>In-depth articles on cryptography, software architecture, and AI-assisted development.</description><link>https://martinbosslet.dev/</link><item><title>OpenSSL PRNG is not (really) fork-safe</title><link>https://martinbosslet.dev/en/blog/2013/openssl-prng-is-not-really-fork-safe/</link><guid isPermaLink="true">https://martinbosslet.dev/en/blog/2013/openssl-prng-is-not-really-fork-safe/</guid><description>An analysis of the fork-safety of OpenSSL&apos;s Pseudo-Random Number Generator (PRNG), including a discussion of the Android SecureRandom incident, the impact of forking on PRNG state, and the implications of relying on uninitialized memory for entropy.</description><pubDate>Wed, 21 Aug 2013 00:00:00 GMT</pubDate></item><item><title>We need to sign Ruby Gems! But how?</title><link>https://martinbosslet.dev/en/blog/2013/we-need-to-sign-ruby-gems-but-how/</link><guid isPermaLink="true">https://martinbosslet.dev/en/blog/2013/we-need-to-sign-ruby-gems-but-how/</guid><description>A comprehensive analysis of the need for signing Ruby Gems, exploring various code signing solutions from Java, Linux distros, Android, and iOS, and discussing their advantages and disadvantages in the context of RubyGems.</description><pubDate>Fri, 15 Feb 2013 00:00:00 GMT</pubDate></item><item><title>Breaking Murmur: Hash-flooding DoS reloaded</title><link>https://martinbosslet.dev/en/blog/2012/breaking-murmur-hash-flooding-dos-reloaded/</link><guid isPermaLink="true">https://martinbosslet.dev/en/blog/2012/breaking-murmur-hash-flooding-dos-reloaded/</guid><description>A detailed analysis of the hash-flooding DoS attack against MurmurHash, including a step-by-step explanation of how the attack works and how it can be mitigated.</description><pubDate>Fri, 14 Dec 2012 00:00:00 GMT</pubDate></item><item><title>Computing the Units Digit of a Power: a Constant-Time Algorithm Using a Little Number Theory</title><link>https://martinbosslet.dev/en/blog/2012/computing-the-units-digit-of-a-power-a-constant-time-algorithm-using-a-little-number-theory/</link><guid isPermaLink="true">https://martinbosslet.dev/en/blog/2012/computing-the-units-digit-of-a-power-a-constant-time-algorithm-using-a-little-number-theory/</guid><description>A deep dive into the problem of computing the units digit of a power, exploring various algorithms and culminating in a constant-time solution using number theory.</description><pubDate>Sun, 14 Oct 2012 00:00:00 GMT</pubDate></item><item><title>How are Enumerators for arbitrary objects implemented?</title><link>https://martinbosslet.dev/en/blog/2012/how-are-enumerators-for-arbitrary-objects-implemented/</link><guid isPermaLink="true">https://martinbosslet.dev/en/blog/2012/how-are-enumerators-for-arbitrary-objects-implemented/</guid><description>An exploration of how Ruby&apos;s Enumerators are implemented for arbitrary objects, including a discussion of eager vs. lazy evaluation and the use of Fibers for efficient iteration.</description><pubDate>Mon, 01 Oct 2012 00:00:00 GMT</pubDate></item></channel></rss>