iiinova — where your digital self keeps evolving

Lynn Engelberts @lynnengelberts.bsky.social · 08/06/2026

Thanks @senykamara.com for putting words to the tension between research-for-problems and research-for-impact. It's rarely discussed, but very relatable and somehow motivating to read near the end of a PhD! senykamara.substack.com/p/contextual...

senykamara.substack.com

Contextualizing Cryptography

What Is Cryptography For?

050

Reposted by Lynn Engelberts

Thatchaphol Saranurak @eigx.bsky.social · 28/05/2026

I fully agree with this post by @gautamkamath.com on how preparing talks is one of the best ways to upgrade my own thinking. So, I certainly do not want to waste that opportunity by delegating it to AI. kamathematics.wordpress.com/2026/05/27/m...

kamathematics.wordpress.com

Making a talk, without and with AI

Some of the discussion online has been about how not to use AI in making academic talks (see, e.g., this post by Jessica Hullman). A junior researcher asked my opinion on using AI to help make slid…

0283

Reposted by Lynn Engelberts

COSIC @cosic.bsky.social · 17/04/2026

Gazet van Antwerpen reports that the EU’s new age‑verification app aims to keep minors off social media while preserving #privacy. But Bart Preneel notes similar bans led to VPN spikes: "You can simply choose a country without age limits." www.gva.be/economie/tec... (paywall)

gva.be

Europa heeft een app klaar waarmee jongeren kunnen bewijzen dat ze oud genoeg zijn voor sociale media: hoe werkt het?

Té jonge kinderen op sociale media? Straks hebben Meta, Tiktok en co. “geen excuses” meer, maakt EU-commissievoorzitter Ursula von der Leyen zich sterk. Want de EU heeft een “privacyvriendelijke” app klaar, waarmee gebruikers hun leeftijd kunnen bewijzen. Hoe werkt die juist?

002

Reposted by Lynn Engelberts

Sam Jaques @sejaques.bsky.social · 09/04/2026

Overdue quantum landscape update: sam-jaques.appspot.com/quantum_land... A 2d chart can only say so much. tl;dr new results are still overhyped, but definitely worth taking seriously. This chart is based on surface codes and a big question now is whether new codes can be practical (=>useless chart)

A cluttered and complicated chart relating qubit counts to qubit error rates, comparing today's devices to cryptographic attacks.

15122

Reposted by Lynn Engelberts

Filippo Valsorda @filippo.abyssdomain.expert · 06/04/2026

Two papers came out last week that suggest classical asymmetric cryptography might indeed be broken by quantum computers in just a few years. That means we need to ship post-quantum crypto now, with the tools we have: ML-KEM and ML-DSA. I didn't think PQ auth was so urgent until recently.

words.filippo.io

A Cryptography Engineer’s Perspective on Quantum Computing Timelines

The risk that cryptographically-relevant quantum computers materialize within the next few years is now high enough to be dispositive, unfortunately.

11303123

Reposted by Lynn Engelberts

Dulwich Quantum Computing @dulwichquantum.bsky.social · 17/02/2026

Next time you start something and don't finish it, you're behaving quantum!

191

Reposted by Lynn Engelberts

FQxI @fqxi.org · 17/02/2026

Quantum teleportation, explained by the person who helped invent it. Bill Wootters spoke to us at @perimeterinstitute.ca

0213

Lynn Engelberts @lynnengelberts.bsky.social · 26/01/2026

This week I'm in a superposition of writing my PhD thesis and attending QIP 2026 in Riga... ⚛️

080

Lynn Engelberts @lynnengelberts.bsky.social · 24/12/2025

Presented my recent paper “Predicting Module-Lattice Reduction” with Léo Ducas and Paola de Perthuis at Asiacrypt 2025 in Melbourne. A great way to wrap up the year! Merry Chrissy everyone :)

051

Reposted by Lynn Engelberts

ePrint Updates @eprint.ing.bot · 04/12/2025

An Improved Quantum Algorithm for 3-Tuple Lattice Sieving (Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf) ia.cr/2025/2189

Abstract. The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP are via so-called sieving methods. While these still take exponential time in the dimension d, they are significantly faster than non-heuristic approaches and their heuristic assumptions are verified by extensive experiments. k-Tuple sieving is an iterative method where each iteration takes as input a large number of lattice vectors of a certain norm, and produces an equal number of lattice vectors of slightly smaller norm, by taking sums and differences of k of the input vectors. Iterating these ‘’sieving steps” sufficiently many times produces a short lattice vector. The fastest attacks (both classical and quantum) are for k = 2, but taking larger k reduces the amount of memory required for the attack. In this paper we improve the quantum time complexity of 3-tuple sieving from 2^(0.3098d) to 2^(0.2846d), using a two-level amplitude amplification aided by a preprocessing step that associates the given lattice vectors with nearby’’center points” to focus the search on the neighborhoods of these center points. Our algorithm uses 2^(0.1887d) classical bits and QCRAM bits, and 2^(o(d)) qubits. This is the fastest known quantum algorithm for SVP when total memory is limited to 2^(0.1887d).

022

Lynn Engelberts @lynnengelberts.bsky.social · 19/10/2025

Excited to share our new paper on module-lattice reduction! 📄 We analyze the average-case behavior of module-BKZ, identifying when structure offers an advantage over standard BKZ and when the benefits are less clear. We also highlight several open directions for future work.

030

Reposted by Lynn Engelberts

Clément Canonne @ccanonne.github.io · 16/09/2025

From Stacey Jeffery's excellent plenary talk at #TQC2025, on "Composing #Quantum Algorithms"

The summary slide of Stacey's talk, explaining the differences between algorithms composition in the classical randomized and the quantum worlds, with links to surveys and papers.

0192

Lynn Engelberts @lynnengelberts.bsky.social · 07/07/2025

High school reunion, 10 years later. Great to catch up with old classmates and friends!

My graduating class, 10 years after finishing high school, standing by a tree we once gifted to the school, now replanted.

020

Lynn Engelberts @lynnengelberts.bsky.social · 24/06/2025

Had an incredible time in Bordeaux last week at a workshop on algebraic lattices in cryptography! 💎 Huge thanks to Alice Pellet-Mary for organizing and giving me the opportunity to present our recent SIS^∞ paper (eprint.iacr.org/2025/575), to appear in CRYPTO 2025!

Me presenting our recent work to the other workshop participants in Bordeaux

040

Reposted by Lynn Engelberts

Sam Jaques @sejaques.bsky.social · 19/06/2025

An out-of-schedule update to my quantum landscape chart: sam-jaques.appspot.com/quantum_land..., prompted by @craiggidney.bsky.social 's new paper: arxiv.org/abs/2505.15917. A startling jump (20x) in how easy quantum factoring can be! Also: much improved web design!

A chart for quantum computers, of number of qubits versus error rate, on a logarithmic scale. Broadly it shows a large gap between current quantum computers in the bottom left, and a curve in the top right of the resources they need to break RSA.

36126

Lynn Engelberts @lynnengelberts.bsky.social · 25/04/2025

Thanks @qctip2025.bsky.social for this inspiring conference! Great talks, great people, great vibes.

120

Lynn Engelberts @lynnengelberts.bsky.social · 01/04/2025

Excited to join Bluesky! I’m a PhD candidate at CWI and QuSoft, working on quantum & classical algorithms for post-quantum cryptanalysis 🔑. Check out our recent paper here: arxiv.org/abs/2503.23238. Looking forward to connecting with others in quantum computing, cryptography, and beyond!

0102