Mastodawn

New breakthrough results for quantum attack resource estimates against 256-bit elliptic curves: most ECC-based applications including ECDSA and Bitcoin could be at risk way sooner than expected:

https://research.google/blog/safeguarding-cryptocurrency-by-disclosing-quantum-vulnerabilities-responsibly/

We estimate that these circuits can be executed on a superconducting qubit CRQC with fewer than 500,000 physical qubits in a few minutes [...] This is an approximately 20-fold reduction in the number of physical qubits required to solve ECDLP-256"

Interestingly, Google and friends did not release the blueprint for the attack circuit. In the name of "responsible disclosure", they only provided a zero-knowledge proof (ZKP) proving that the circuit works. This is, I think , a first in the realm of cryptanalysis disclosure.

The statement that our ZK proof demonstrates is the following: we possess a classical reversible circuit of a specified size which on most inputs correctly computes point addition on the elliptic curve secp256k. This is the primary bottleneck in Shor’s quantum algorithm

I have been saying this since the 2010s: quantum cryptanalysis is one of those non-linear technology progresses that will take everyone by surprise when it arrives. Qubits quality and numbers go up, error-correction and attacks improve, investments scale up accordingly. It's a perfect storm of compound factors. Folks didn't listen, now time is ticking.

More context at: https://gagliardoni.net/#20260331_new_quantum_estimates

#quantum #quantumcomputing #cryptography #security #cybersecurity #infosec #google #bitcoin #blockchain #ethereum #zkp #zeroknowledge

Safeguarding cryptocurrency by disclosing quantum vulnerabilities responsibly

Tommaso Gagliardoni 15h ago

Sophie Schmieg 17h ago

Are we having fun yet?

https://arxiv.org/abs/2603.28627

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.

arXiv.org

Tommaso Gagliardoni 4d ago

Another Friday afternoon.

#politics #usa #iran #war #trump

Tommaso Gagliardoni 6d ago

Dear LinkedIn,

It is great that you respect my privacy. But I'm confused: I thought I had previously already denied AT LEAST 89 OTHER TIMES my consent for you to profile me, track me with 3rd party cookies, anally probing me, and generally making my life a bit more miserable.

To you and all the other countless buffoons out there: could you please kindly f**k off?

#linkedin #privacy #ad #gdpr #enshittification #consent

Tommaso Gagliardoni Mar 23

ℹ️❤️🖥 aka Compy-chan Mar 23

Sums up my experience growing up

Tommaso Gagliardoni Mar 13

Tablaste Mar 13

I traced $2 billion in nonprofit grants and 45 states of lobbying records to figure out who's behind the age verification bills

https://linux.community/post/4606267

Tommaso Gagliardoni Mar 13

Dane 🌎🖖✌️☮️⚛️☸️🕉️Mar 13

A long and WELL sourced post on exactly who has been behind all the state level legislation aimed at OS level age verification.

"I traced $2 billion in nonprofit grants and 45 states of lobbying records to figure out who's behind the age verification bills. The answer involves a company that profits from your data writing laws that collect more of it."

*EDIT*
Direct link to the GitHub dataset:

https://github.com/upper-up/meta-lobbying-and-other-findings

Original redlib post and comments:

https://redlib.catsarch.com/r/linux/comments/1rshc1f/i_traced_2_billion_in_nonprofit_grants_and_45/

#AgeVerification #Infosec #Privacy #Discord #Mastodon #Meta #Zuckerberg #FollowTheMoney

GitHub - upper-up/meta-lobbying-and-other-findings

Contribute to upper-up/meta-lobbying-and-other-findings development by creating an account on GitHub.

GitHub

Tommaso Gagliardoni Mar 13

This is big but not unexpected: Meta built a multi-channel influence operation to pass age verification laws.

https://github.com/upper-up/meta-lobbying-and-other-findings

The original Reddit posts were removed, but they are archived:

https://web.archive.org/web/20260313090844/https://www.reddit.com/r/linux/comments/1rshc1f/i_traced_2_billion_in_nonprofit_grants_and_45/

https://web.archive.org/web/20260313125244/https://old.reddit.com/r/linux/comments/1rshc1f/i_traced_2_billion_in_nonprofit_grants_and_45/

This is your daily reminder that if you're a cryptographer and work for Meta - including taking their grant money - you need some serious 4d chess creativity to look at yourself in the mirror.

#security #privacy #cryptography #meta #surveillance #politics #censorship #lobbying #ageverification

GitHub - upper-up/meta-lobbying-and-other-findings

Contribute to upper-up/meta-lobbying-and-other-findings development by creating an account on GitHub.

GitHub

Tommaso Gagliardoni Mar 13

Hello!

#usa #politics #war #iran #finance

Tommaso Gagliardoni Mar 12

Soatok Dreamseeker Mar 11

At #RealWorldCrypto this year, there was a session on "privacy-enhancing technologies".

The first talk in the session was about a new encryption method for Tor.

The next two were painful examples of "a person cannot be convinced of something when their salary depends on them not knowing it".

Advertisers wants to collect signals about populations without being individually identifying. So let's talk about differential privacy techniques to let them do that.

One example was "Meta wants to know what percentage of its teneage users blocked a contact today".

At no point did they address the elephants in the room.

Why do they want this data in the first place?
What are they even doing with this signal?
Have you considered telling them to fuck off and not collect it in the first place?

As tempting as it might be to hand wave it, and say "well yes but their business model depends on it", I say to advertisers, "then perish".

Homepage	https://gagliardoni.net/
Linkedin	https://www.linkedin.com/in/tommasogagliardoni/
Shufflecake	https://shufflecake.net/
My own company	https://www.lucumo.net/