<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Pentesting on Jonas Lieb</title><link>https://www.jonaslieb.de/tags/pentesting/</link><description>Recent content in Pentesting on Jonas Lieb</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 09 Mar 2026 21:10:00 +0100</lastBuildDate><atom:link href="https://www.jonaslieb.de/tags/pentesting/index.xml" rel="self" type="application/rss+xml"/><item><title>TOTP Brute-Force Statistics</title><link>https://www.jonaslieb.de/blog/totp-brute-force/</link><pubDate>Mon, 09 Mar 2026 21:10:00 +0100</pubDate><guid>https://www.jonaslieb.de/blog/totp-brute-force/</guid><description>&lt;p&gt;There is this tiny statistics problem in IT security that almost nobody talks
about, yet I have seen people get it wrong many times in the past: Calculation
of the success probability of brute-force attacks against TOTP two-factor
authenticators.&lt;/p&gt;
&lt;p&gt;As a reminder: TOTP tokens are defined in &lt;a class="external-link" target="_blank" href="https://datatracker.ietf.org/doc/html/rfc6238" title="RFC 6238 (&amp;#34;TOTP: Time-Based One-Time Password Algorithm&amp;#34;)"&gt;RFC 6238 (&amp;#34;TOTP: Time-Based One-Time Password Algorithm&amp;#34;)&lt;/a&gt;. They usually consist
of six-digit strings that change every 30 seconds. The entire sequence of tokens
is derived from a secret (and the current time) in a way that makes token
prediction without the secret impossible. TOTP tokens are commonly used as a
second factor, in addition to a user&amp;rsquo;s password, reducing the impact of a
potential password compromise.&lt;/p&gt;</description></item></channel></rss>