Steharringer

0 Followers
50 Following
113 Posts
Google bumps up Q Day estimate to 2029, far sooner than previously thought
Company warns entire industry to move off RSA and EC more quickly.
https://arstechnica.com/security/2026/03/google-bumps-up-q-day-estimate-to-2029-far-sooner-than-previously-thought/?utm_brand=arstechnica&utm_social-type=owned&utm_source=mastodon&utm_medium=social

“I wanted the blue checkmark on LinkedIn. The one that says “this person is real.” In a sea of fake recruiters, bot accounts, and AI-generated headshots, it seemed like a smart thing to do.

So I tapped “verify.” I scanned my passport. I took a selfie. Three minutes later — done. Badge acquired. I felt a tiny dopamine hit of legitimacy.

Then I did what apparently nobody does. I went and read the privacy policy and terms of service.

Not LinkedIn’s. The other company’s”

https://thelocalstack.eu/posts/linkedin-identity-verification-privacy/

🌐 The security community has moved 🔐protocols over the last decade from RSA to elliptic curves, allowing for smaller key sizes

⚛️ While #quantum algorithms research focused around optimizing Shor’s (breaking RSA), a new result shows that breaking the elliptic curve discrete logarithm problem requires significantly less qubits than previously thought.

⚠️ Breaking P-256, which has equivalent classical security to RSA-3072, only requires 1193 logical qubits against 2043.

https://eprint.iacr.org/2026/280

Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves

Solving the Discrete Logarithm problem on the group of points of an elliptic curve is one of the major cryptographic applications of Shor's algorithm. However, current estimates for the number of qubits required remain relatively high, and notably, higher than the best recent estimates for factoring of RSA moduli. For example, recent work by Gidney (arXiv 2025) estimates 2043 logical qubits for breaking 3072-bit RSA, while previous work by Häner et al. (PQCrypto 2020) estimates a requirement of 2124 logical qubits for solving discrete logarithm instances on 256-bit elliptic curves over prime fields. Indeed, for an $n$-bit elliptic curve, the most space-optimized optimized implementation by Proos and Zalka (Quant. Inf. Comput. 2003) gives $5n + o(n)$ qubits, as more additional space is required to store the coordinates of points and compute the addition law. In this paper, we propose an alternative approach to the computation of point multiplication in Shor's algorithm (on input $k$, computing $k P$ where $P$ is a fixed point). Instead of computing the point multiplication explicitly, we use a Residue Number System to compute directly the projective coordinates of $k P$ with low space usage. Then, to avoid performing any modular inversion, we compress the result to a single bit using a Legendre symbol. This strategy allows us to obtain the most space-efficient polynomial-time algorithm for the ECDLP to date, with only $3.12n + o(n)$ qubits, at the expense of an increase in gate count, from $\mathcal{O}(n^3)$ to $\widetilde{\mathcal{O}}(n^3)$. For $n = 256$ we estimate that 1098 qubits would be necessary, with 22 independent runs, using $2^{38.10}$ Toffoli gates each. This represents a much higher gate count than the previous estimate by Häner et al. (roughly $2^{30}$), but half of the corresponding number of qubits (2124).

IACR Cryptology ePrint Archive

Ich musste hier 👉 https://www.metacheles.de/openclaw-und-moltbook-agentic-ai-im-ausnahmezustand/ ordentlich ranten!

"Heute #OpenClaw, morgen der naechste Agenten-Container, uebermorgen irgendeine Bot-Community, die sich selbst fuer Bewusstsein haelt... und zwischendrin wird das Netz zugemuellt, #OpenSource ueberrollt, Accounts werden verknuepft wie Weihnachtsbeleuchtung und am Ende wundern sich alle, wenn es knallt."

Ich kann diese ganzen Automatisierungsclowns kaum noch ertragen & hole zum Rundumschlag aus!

Gerne boosten. Danke dafuer 🫶

OpenClaw und Moltbook - Agentic AI im Ausnahmezustand

Na, habt ihr es auch schon ausprobiert...? OpenClaw, Moltbot, Rent a Human, Moltbook... wie auch immer der Kram diese Woche heisst. Und jetzt traeumt ihr von Hunderten Agenten, die euch „die nervige Arbeit im Netz abnehmen“, waehrend ihr euch zuruecklehnt und nebenbei noch Geld verdient. Klar. Genau so wird das.

MeTacheles

Ten years ago today, physicists reported the first direct detection of gravitational waves, produced by colliding black holes 1.3 billion light years away.

That was when we, as a species, developed space-time eyes. My Invisible Universe column:

https://invisibleuniverse.substack.com/p/the-day-we-evolved-space-time-eyes #space #science #nature #technology

Your Thursday night moment of zen: Let it go! from Frozen sung in the native Klingon. 😎🤓😅

“QorDu’ vItlhutlhbe’pu’, vaj jIH vItlhutlhbe’!” ❄️
#StarTrek 🖖

There are more of course....
Digital Forensics and Incident Response in the World of Industrial Control Systems with Lesley Carhart

Podcast Episode · Cyber Pulse · 06/26/2025 · 52m

Apple Podcasts