<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Security | Valentijn &amp; co</title><link>https://valentijn.co/tags/security/</link><atom:link href="https://valentijn.co/tags/security/index.xml" rel="self" type="application/rss+xml"/><description>Security</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 24 Mar 2025 00:00:00 +0000</lastBuildDate><image><url>https://valentijn.co/media/icon_hu5179653897708092653.png</url><title>Security</title><link>https://valentijn.co/tags/security/</link></image><item><title>Prince Processor</title><link>https://valentijn.co/project/prince-processor/</link><pubDate>Mon, 24 Mar 2025 00:00:00 +0000</pubDate><guid>https://valentijn.co/project/prince-processor/</guid><description>&lt;p>Re-imagination of the &lt;a href="https://github.com/hashcat/princeprocessor" target="_blank" rel="noopener">original&lt;/a> PRINCE processor written in C.&lt;br>
The name PRINCE is used as an acronym and stands for PRobability INfinite Chained Elements, which are the building blocks of the algorithm.&lt;/p>
&lt;p>Following a series of unfortunate events, I was locked out of an encrypted drive. In an attempt to generate a dictionary using conventional methods, I ran into some issues with Hashcat&amp;rsquo;s PRINCE processor. It turned out that it contains an overflow error, where it would exit prematurely, leaving lots of word combinations untouched.
I then compiled a new version in Go, overcoming these issues. Due to the mathematical complexity, processing a small wordlist takes a lot of time and resources.&lt;/p>
&lt;p>I am still to unlock the drive. It&amp;rsquo;s a lesson of always keeping a backup of even the most memorable passphrases.&lt;/p></description></item></channel></rss>