<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: zimmerfrei</title><link>https://news.ycombinator.com/user?id=zimmerfrei</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 14 May 2026 20:24:22 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=zimmerfrei" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by zimmerfrei in "Nvidia's 10-year effort to make the Shield TV the most updated Android device"]]></title><description><![CDATA[
<p>> Nvidia released the first Shield Android TV in 2015<p>> it took about 18 months to [create] an entirely new security stack [...] Android updates aren’t actually that much work compared to DRM security, and some of its partners weren’t that keen on re-certifying older products.<p>> In February 2025, Nvidia released Shield Patch 9.2 [...] That was the Tegra X1 [security] bug finally being laid to rest on the 2015 and 2017 Shield boxes.<p>This is a real engineering marvel. Everybody else would have just  given up entirely long time ago. DRM bugs are in most case practically unrecoverable for products that shipped already (and physically in the hands of the adversary). The incentive to tell to consumers "Ditch that product you bought from us 2 years ago, and buy the more recent hardware revision or successor" is extremely strong.<p>This really feels like a platform that is maintained with pride and love by the nvidia engineering teams (regardless of one's opinion about DRM per se).</p>
]]></description><pubDate>Sun, 01 Feb 2026 08:16:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=46844471</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46844471</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46844471</guid></item><item><title><![CDATA[New comment by zimmerfrei in "Lennart Poettering, Christian Brauner founded a new company"]]></title><description><![CDATA[
<p>I don't think that a 100% anonymous attestation protocol is what most people need and want.<p>It would be sufficient to be able to freely choose who you trust as proxy for your attestations *and* the ability to modify that choice at any point later (i.e. there should be some interoperability). That can be your Google/Apple/Samsung ecosystem, your local government, a company operating in whatever jurisdiction you are comfortable with, etc.</p>
]]></description><pubDate>Wed, 28 Jan 2026 05:04:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=46791272</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46791272</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46791272</guid></item><item><title><![CDATA[New comment by zimmerfrei in "The PGP problem (2019)"]]></title><description><![CDATA[
<p>If you use AEAD, you clearly expect your recipients to use a recent client. Same as if you want to use PQC or any other recent feature.<p>If your audience is wider, dont use AEAD but make sure to sign the data too.<p>With respect to the 90's design, yes, it is not pretty and it could be simpler. It is also not broken and not too difficult to understand.</p>
]]></description><pubDate>Sun, 04 Jan 2026 22:01:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=46492741</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46492741</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46492741</guid></item><item><title><![CDATA[New comment by zimmerfrei in "The PGP problem (2019)"]]></title><description><![CDATA[
<p>It is not a coincidence that most of the various proposed alternatives to PGP (signal, wormhole, age, minisign, etc) are led by a single golden implementation and neither support nor promote community-driven specifications (e.g., at the IETF).<p>Over the decades, PGP has already transitioned out of old key formats or old crypto. None of us is expecting to receive messages encrypted with BassOmatic (the original encryption algorithm by Zimmermann) I assume? The process has been slow, arguably way slower than it should have after the advancements in attacks in the past 15 years (and that is exactly the crux behind the schism librepgp/opengpgp). Nonetheless, here we are, pointing at the current gpg as "the" interoperable (yet flawed) standard.<p>In this age, when implementations are expected (sometimes by law) to be ready to update more quickly, the introduction of new crypto can take into account adoption rates and the specific context one operates in. And still, that happens within the boundaries of a reasonably interoperable protocol.<p>TLS 1.3 is a case in point - from certain points of view, it has been a total revolution and break with the past. But from many others, it is still remarkably similar to the previous TLS as before, lots of concepts are reused, and it can be deemed as an iteration of the same standard. Nobody is questioning its level of interoperability, and nobody is shocked by the fact that older clients can't connect to a TLS 1.3-only server.</p>
]]></description><pubDate>Sun, 04 Jan 2026 16:14:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=46489347</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46489347</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46489347</guid></item><item><title><![CDATA[New comment by zimmerfrei in "The PGP problem (2019)"]]></title><description><![CDATA[
<p>When you encrypt something, you are the one deciding which level of interoperability 
you want and you can select the crypto primitives matching capabilities you know you recipient reasonably have. I don't see anything special with this: when you run a web service, you also decide if you want to talk to TLS 1.0 clients (hopefully not).<p>sequoia's defaults are reasonable as far as I remember. It's also bit strange that the post found it defaulted to using AEAD in 2019 when AEAD was standardized only in 2024 with RFC 9580.<p>But the elephant in the room is that gpg famously decided to NOT adopt RFC 9580 (which Sequoia and Proton do support) and stick to a variant of the older RFC (LibrePGP), officially because the changes to the crypto were seen as too "ground-breaking".</p>
]]></description><pubDate>Sun, 04 Jan 2026 14:27:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=46488242</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46488242</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46488242</guid></item><item><title><![CDATA[New comment by zimmerfrei in "The PGP problem (2019)"]]></title><description><![CDATA[
<p>As mentioned a few days ago, this post mainly covers a gpg problem not a PGP problem.<p>I recommend people to spend some time and try out sequoia (sq) [0][1], which is a sane, clean room re-implementation of OpenPGP in Rust. For crypto, it uses the backend you prefer (including openssl, no more ligcrypt!) and it isn't just a CLI application but also as a library you can invoke from many other languages.<p>It does signing and/or encryption, for modern crypto including AEAD, Argon2, PQC.<p>Sure, it still implements OpenPGP/RFC 9580 (which is not the ideal format most people would define from scratch today) but it throws away the dirty water (SHA1, old cruft) while keeping the baby (interoperability, the fine bits).<p>[0] <a href="https://sequoia-pgp.org/" rel="nofollow">https://sequoia-pgp.org/</a><p>[1] <a href="https://archive.fosdem.org/2025/events/attachments/fosdem-2025-6297-a-practical-introduction-to-using-sq-sequoia-pgp-s-cli/slides/237970/presentat_pvYEqR5.pdf" rel="nofollow">https://archive.fosdem.org/2025/events/attachments/fosdem-20...</a></p>
]]></description><pubDate>Sun, 04 Jan 2026 12:57:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=46487500</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46487500</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46487500</guid></item><item><title><![CDATA[New comment by zimmerfrei in "Gpg.fail"]]></title><description><![CDATA[
<p>This is the right answer.<p>The problem mostly concerns the oldest parts of PGP (the protocol), which gpg (the implementation) doesn't want or cannot get rid of.</p>
]]></description><pubDate>Sun, 28 Dec 2025 07:08:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=46409099</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=46409099</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46409099</guid></item><item><title><![CDATA[Lex Fridman Podcast: Pieter Levels]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=oFtjKbXKqbg">https://www.youtube.com/watch?v=oFtjKbXKqbg</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41313110">https://news.ycombinator.com/item?id=41313110</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 21 Aug 2024 18:58:43 +0000</pubDate><link>https://www.youtube.com/watch?v=oFtjKbXKqbg</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=41313110</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41313110</guid></item><item><title><![CDATA[New comment by zimmerfrei in "NIST Announces Post-Quantum Cryptography Standards"]]></title><description><![CDATA[
<p>Yes, there are methods to combine multiple, different key exchange algorithms so that you need to break all, like in:<p><a href="https://datatracker.ietf.org/doc/rfc9370/" rel="nofollow">https://datatracker.ietf.org/doc/rfc9370/</a><p><a href="https://datatracker.ietf.org/doc/draft-ounsworth-cfrg-kem-combiners/" rel="nofollow">https://datatracker.ietf.org/doc/draft-ounsworth-cfrg-kem-co...</a><p><a href="https://www.etsi.org/deliver/etsi_ts/103700_103799/103744/01.01.01_60/ts_103744v010101p.pdf" rel="nofollow">https://www.etsi.org/deliver/etsi_ts/103700_103799/103744/01...</a><p>For other security mechanisms, like PKI, things are more complicated (and inefficient).<p>And one can argue that even if in theory the above gives you better security margin, the whole system becomes more complicated, and it may be practically less secure because of the additional moving parts. That is why there is no unanimous consensus: agencies in Europe recommend it, but the NSA does not.<p>Finally, note that the the 3rd standard (SLH-DSA), is PQC <i>but</i> it is based on old and well-understood standards (SHA2/SHA3), so it can arguably be used by itself.</p>
]]></description><pubDate>Sat, 17 Aug 2024 08:01:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=41272710</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=41272710</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41272710</guid></item><item><title><![CDATA[New comment by zimmerfrei in "The XAES-256-GCM extended-nonce AEAD"]]></title><description><![CDATA[
<p>I like it, because it is indeed nice to have a NIST-backed construction.<p>But at the same time, it is disappointing that you get locked out of several niceties of NIST KDFs, such as label and context. I get that they are sacrificed to minimize the number of AES calls, but still I would prioritize strong cryptographic separation over just a few saved AES calls, especially for messages longer than a few hundred bytes.<p>Finally, *random* GCM nonces longer than 96 bits are definitely misunderstood and bring better guarantees than 96 bits nonces [1]. But of course, if you can derive a fresh key for every message, that's definitely to prefer.<p>[1] <a href="https://neilmadden.blog/2024/05/23/galois-counter-mode-and-random-nonces/" rel="nofollow">https://neilmadden.blog/2024/05/23/galois-counter-mode-and-r...</a></p>
]]></description><pubDate>Sun, 30 Jun 2024 15:24:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=40837705</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=40837705</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40837705</guid></item><item><title><![CDATA[New comment by zimmerfrei in "A beginner's guide to constant-time cryptography (2017)"]]></title><description><![CDATA[
<p>Let's assume that you have a simple XOR between two registers.<p>If the CPU can pre-label a register as having no bits set (and they can or speculate on it), during scheduling, it could theoretically simply drop the XOR, transfer or rename the relevant register which may lead to a tiny but different timing that can be measured and exploited.<p>That is just one simple counter-example that shows how the assumptions you present are not necessarily valid on modern complex CPUs. Many more are examples are possible, which is of course not to say that they are implemented today. But they could be implemented in the future (without us knowing, and again, both ARM and Intel are explicit on that), therefore the security of a security-sensitive piece of code should not solely rely on that.</p>
]]></description><pubDate>Thu, 22 Feb 2024 18:13:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=39470890</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39470890</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39470890</guid></item><item><title><![CDATA[New comment by zimmerfrei in "A beginner's guide to constant-time cryptography (2017)"]]></title><description><![CDATA[
<p>Your argument boils down to "all hardware implementations so far in history never optimized word boolean operations so future implementations will keep doing so".<p>I think that is just an assumption and I would not take that risk for high security applications, unless for specific CPU models where the behavior is measured in practice (certainly not by just auditing the assembly, which is by itself already too high-level). After all, never in history we had such a level of sophistication.<p>Right now, all zero register values  can lead to speed gains, so they could be obversable. But both ARM and Intel latest ISA have introduced flags that permit the future CPUs to perform operations with data-dependent timing. Boolean operations are officially marked as potentially affected by that flag.</p>
]]></description><pubDate>Thu, 22 Feb 2024 13:19:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=39466608</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39466608</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39466608</guid></item><item><title><![CDATA[New comment by zimmerfrei in "A beginner's guide to constant-time cryptography (2017)"]]></title><description><![CDATA[
<p>You assume that boolean operations are constant time, and whether that holds depends on the uarchitecture and how sophisticated the optimization layers are (e.g. nothing prevents the compiler or even the CPU from short-circuiting the OR as soon as the first XOR is non-zero).<p>Computing a MAC of the two input values under a once-off random key is actually much stronger.<p>As a matter of that, this highlights that the goal is to lower the SNR for the attacker, and constant time computation is only one of the two non-exclusive ways to achieve that, the other being adding sufficient noise to their measurements.</p>
]]></description><pubDate>Thu, 22 Feb 2024 10:32:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=39465304</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39465304</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39465304</guid></item><item><title><![CDATA[A multi-core Python HTTP server (much) faster than Go (spoiler: Cython) (2018)]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.nexedi.com/NXD-Blog.Multicore.Python.HTTP.Server">https://www.nexedi.com/NXD-Blog.Multicore.Python.HTTP.Server</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=39155114">https://news.ycombinator.com/item?id=39155114</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 27 Jan 2024 12:51:29 +0000</pubDate><link>https://www.nexedi.com/NXD-Blog.Multicore.Python.HTTP.Server</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39155114</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39155114</guid></item><item><title><![CDATA[New comment by zimmerfrei in "Huawei claims HarmonyOS NEXT kernel is more efficient than Linux"]]></title><description><![CDATA[
<p>That's still described as a kernel for the TEE (like OPTEE is), it doesn't look like a replacement for Linux, which runs in the REE.</p>
]]></description><pubDate>Sun, 21 Jan 2024 19:21:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=39081914</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39081914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39081914</guid></item><item><title><![CDATA[New comment by zimmerfrei in "RSA is deceptively simple and fun"]]></title><description><![CDATA[
<p>But then, the vast majority of the affected libraries in that page don't use GMP at all, but their own custom implementation (including openssl).<p>In reality, RSA signing with blinding will make any implementation (including those based on GMP) resistant to side channel attacks, targeted at the private key.<p>What most of these library tripped over in that case, is the treatment of the plaintext in a side channel-safe way after the private key operation. For instance, just the simple conversion of an integer to a byte string can be targeted.</p>
]]></description><pubDate>Fri, 19 Jan 2024 11:26:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=39054225</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=39054225</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39054225</guid></item><item><title><![CDATA[NetHSM – The Trustworthy, Open Hardware Security Module That Just Works]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.nitrokey.com/products/nethsm">https://www.nitrokey.com/products/nethsm</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=38485469">https://news.ycombinator.com/item?id=38485469</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 01 Dec 2023 11:08:09 +0000</pubDate><link>https://www.nitrokey.com/products/nethsm</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=38485469</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38485469</guid></item><item><title><![CDATA[New comment by zimmerfrei in "Snowden leak: Cavium networking hardware may contain NSA backdoor"]]></title><description><![CDATA[
<p>Certainly Google (and Oracle and AWS):<p><a href="https://www.marvell.com/company/newsroom/marvell-enables-enterprise-data-center-and-private-cloud-security-with-innovative-liquidsecurity-network-hsm.html" rel="nofollow noreferrer">https://www.marvell.com/company/newsroom/marvell-enables-ent...</a></p>
]]></description><pubDate>Tue, 19 Sep 2023 16:33:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=37572429</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=37572429</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37572429</guid></item><item><title><![CDATA[New comment by zimmerfrei in "Snowden leak: Cavium networking hardware may contain NSA backdoor"]]></title><description><![CDATA[
<p>More interestingly, Cavium (now Marvell) also designed and manufactured the HSMs which are used by the top cloud providers (such as AWS, GCP, possibly Azure too), to hold the most critical private keys:<p><a href="https://www.prnewswire.com/news-releases/caviums-liquidsecurity-hsm-enables-hybrid-cloud-users-to-synchronize-keys-between-aws-cloudhsm-and-private-clouds-300631079.html" rel="nofollow noreferrer">https://www.prnewswire.com/news-releases/caviums-liquidsecur...</a></p>
]]></description><pubDate>Tue, 19 Sep 2023 15:09:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=37571014</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=37571014</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37571014</guid></item><item><title><![CDATA[Public Discussion of CommScope CA Inclusion Request]]></title><description><![CDATA[
<p>Article URL: <a href="https://groups.google.com/a/ccadb.org/g/public/c/HVwBXDw6GnU">https://groups.google.com/a/ccadb.org/g/public/c/HVwBXDw6GnU</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=37538820">https://news.ycombinator.com/item?id=37538820</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 16 Sep 2023 21:19:39 +0000</pubDate><link>https://groups.google.com/a/ccadb.org/g/public/c/HVwBXDw6GnU</link><dc:creator>zimmerfrei</dc:creator><comments>https://news.ycombinator.com/item?id=37538820</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37538820</guid></item></channel></rss>