FINALLY, GOOD NEWS. WE CAN RUN AI ON ENCRYPTED DATA WITHOUT EVER DECRYPTING IT.
For years, Fully Homomorphic Encryption, or FHE, was beautiful in theory and slow in practice. In 2026, Craig Gentry, the inventor of FHE, and Yongwoo Lee changed the target. Instead of making FHE faster for everything, they made it fast for the one thing AI actually does: matrix arithmetic. This is the constructive breakthrough in our top 7. The rest were attacks. This one builds.
_________________________
HERE IS WHAT HAPPENED, STEP BY STEP:
---------------------------
THE CORE SCHEME - GL
Gentry and Lee proposed the GL scheme in ePrint 2025/1935. It is based on Ring Learning With Errors, or RLWE. It supports matrix multiplication, Hadamard products, and addition without interslot transformations. The trick is the trace map. Decryption commutes with trace, so matrix multiplication on slots can be done as plain matrix multiplication on ciphertext coefficients.
WHY MATRICES MATTER
Transformers live on matrix multiplication. Old FHE schemes were built for component-wise addition and multiplication. That is the wrong shape for AI. GL is built for the right shape. You encode matrices into slots, multiply, and the math lines up.
THE BOTTLENECK - BOOTSTRAPPING
Every FHE ciphertext gathers noise. When noise gets too high, decryption fails. Bootstrapping refreshes the ciphertext so you can keep computing forever. In CKKS-style bootstrapping, the CtS and StC steps, which move data between coefficients and slots, dominate the cost.
THE 2026 FIX - EFFICIENT BOOTSTRAPPING
Crockett, Gentry, Kim, Lee and Lee posted ePrint 2026/956. They turn CtS and StC into ciphertext-plaintext matrix multiplications, which GL does natively. Result: only 3 key-switching operations, not dozens of rotations. Linear transforms drop to 20.1 percent of bootstrapping time, vs 54.9 to 71.7 percent in prior CKKS bootstrapping. Amortized CtS is about 3x faster than the well-optimized Lattigo library, even without low-level optimizations. They also generalize GL to non-power-of-two dimensions.
_________________________
WHY IT MATTERS NOW
---------------------------
This is private AI without trust. A hospital can send encrypted patient data to a cloud AI and get an encrypted answer back. A bank can run fraud models on encrypted transactions. No one in the middle sees the data. It is still not cheap, and it is still not plug-and-play, but the bottleneck just moved. For builders, start with one high-value, high-privacy workload. Do not try to encrypt everything on day one.
THE AI + QUANTUM FUTURE:
This is where the fusion gets hopeful. AI needs data. Quantum threatens old encryption. FHE based on RLWE is designed to survive quantum attacks, and it lets AI compute without seeing the data. In the future, you will have AI agents that attack crypto, quantum computers that break old keys, and FHE systems that let AI work on encrypted data safely. The same math family, lattices, gives us both the threat and the shield. Privacy will not come from hiding data. It will come from computing on data that stays encrypted.
Sources:
eprint.iacr.org/2025/1935
eprint.iacr.org/2026/956
#FHE #PrivateAI #Cryptography #PostQuantum #AI #QuantumComputing #CyberSecurity #CryptoAgility
1
84
ποΈ "AI doesnβt have to go rogue to break the world. It just has to follow our rules a little too literally."
_______________
A vital reality check from DEF CON 34 on the true nature of AI hacking. We are moving past science fiction into a new era, unfortunately.
youtube.com/watch?v=eEBv0STiβ¦
#CyberSecurity #ArtificialIntelligence #Cryptography #PakCrypt #InfoSec #AIethics #TechLeadership
1
3
27
GPT-5 JUST BROKE A POST-QUANTUM SIGNATURE IN A FEW HOURS. THE HUMAN JUST ASKED THE RIGHT QUESTIONS.
In Sept 2026, Augustin Bariant of ANSSI in Paris posted a paper with a title no one could ignore: A Forgery Attack against Frobenius-UOV: Found with LLM.
The attack was found by OpenAI GPT-5 after a few hours of work. Not months. Hours. A brand new 2026 signature scheme, broken before it could even get deployed.
______________
HERE IS WHAT HAPPENED, STEP BY STEP:
MAY 2026 - THE TARGET
Frobenius-UOV, or F-UOV, was proposed by Macario-Rat in 2026. Multivariate signatures are attractive because they offer short signatures and cheap verification. The big problem with classic UOV is huge public keys. F-UOV added Frobenius structure to shrink the key and speed up verification, aiming for EUF-CMA security.
SEPT 2026 - THE PAPER
Bariant posted ePrint 2026/1927. The paper is short, direct, and devastating. It shows you can forge a signature without the secret key, by exploiting the exact constants chosen in the specification.
THE TRICK
The public equations reduce to a six-term univariate equation. Bariant shows the specific choice of constants a_k and b_k in the spec lets you solve it efficiently without the secret key. He introduces a variable for a Frobenius power of x, derives two low-degree bivariate equations, and solves them with a linearized resultant. No secret key. No brute force. Just structure.
THE NUMBERS
Under heuristic assumptions, the average complexity is about 2^45 field operations for the claimed 128-bit instance, 2^52 for the 192-bit instance, and 2^53 for the 256-bit instance. That is not a small gap. That is a total collapse. The paper says it may be mitigated by changing the exponents a_k and b_k, but the proposed parameters are dead.
____________________________
WHY IT MATTERS NOW:
------------------------------
If you picked F-UOV for fast verification, stop. Do not deploy the proposed parameters. For builders: structure that makes keys small often creates new attack surface. For buyers: ask for independent cryptanalysis, not just performance benchmarks. Classic UOV is not broken by this attack, but new structured variants need years of scrutiny before you trust them with real signatures.
THE AI + QUANTUM FUTURE:
This is the fusion moment. In our fourth story, DeepMind agents reran an RSA attack in 3 days. Here, GPT-5 found a new attack in a few hours. Soon AI will propose schemes, attack schemes, and check proofs in the same loop, while quantum computers change what "hard" even means. The winning team will not be human-only or AI-only. It will be human judgment plus AI speed plus formal verification. Build for that world, and build crypto you can swap when the next few-hours break lands.
Source:
eprint.iacr.org/2026/1927
#PostQuantum #GPT5 #AI #Cryptography #UOV #Multivariate #QuantumComputing #CyberSecurity #CryptoAgility
1
2
42
THE MAN WHO HELPED INSPIRE SHOR'S ALGORITHM JUST CLAIMED TO BREAK LATTICES. 12 DAYS LATER, HE WAS PROVEN WRONG.
On 3 Aug 2026, Daniel R. Simon of AWS, the Simon of Simon's algorithm, posted a preliminary draft claiming a polynomial-time quantum algorithm for the Dihedral Coset Problem, or DCP. If true, it would have shaken the lattice math behind ML-KEM and ML-DSA. 12 days later, it was formally refuted.
_______________
HERE IS WHAT HAPPENED, STEP BY STEP:
AUG 3 - THE CLAIM
Simon claimed a polynomial-time quantum algorithm for DCP in ePrint 2026/1591. DCP is not a deployed scheme. It is a deep problem connected by Regev's reduction to unique shortest vector and Learning With Errors.
WHY IT SCARED EVERYONE
LWE and Module-LWE are the foundation of ML-KEM and ML-DSA, the NIST post-quantum standards. A fast DCP solver, if it composed to real parameters, would put that foundation under direct pressure. No attack on deployed ML-KEM was shown, but the claim came from a legend, so everyone had to take it seriously.
AUG 15 - THE REFUTATION
Aparna Gupte of MIT, Seyoon Ragavan of Google and MIT, and Mark Zhandry of Google and Stanford posted ePrint 2026/1693. They proved Simon's algorithm does not solve DCP. Not just that the proof had a gap. That the algorithm itself cannot work.
THE MECHANISM
After the subset-sum measurement, Simon's algorithm can be implemented using only the most-significant third of the Fourier labels, up to exponentially small error. That throws away the information needed to recover the secret. Their no-go theorem covers that whole class of algorithms, not just one bug.
_______________
WHY IT MATTERS NOW:
Do not pause your ML-KEM migration over a preprint headline. Do not declare lattices dead over a preprint headline either. This episode is how science is supposed to work: bold claim, fast public check, formal kill. The lesson is crypto-agility. If one family ever falls, you need a plan to swap, not a plan to panic.
This will happen faster now. AI will propose more quantum algorithms, more lattice attacks, more bold claims, in weeks not years. The bottleneck will not be generating ideas. It will be verifying them. Formal proofs, machine-checked code, and open refutations will be the real defense. Quantum gives the threat. AI gives the speed. Verification gives the trust.
Source:
eprint.iacr.org/2026/1693
#QuantumComputing #PostQuantum #Lattice #MLKEM #Cryptography #AI #CyberSecurity #CryptoAgility
THEY FORGED RSA SIGNATURES WITHOUT THE KEY. WITHOUT FACTORING. ON A REAL HSM.
On 20 Sept 2026, Shea, Haller, Suhl, Heninger and Thome published something that sounds impossible. They forged 1024-bit RSA signatures without recovering the private key and without factoring the modulus. And they did it through a real Thales Luna HSM. This is not theory. This is a measured run.
++++++++++++++++
HERE IS WHAT HAPPENED, STEP BY STEP:
____________
SEPT - THE PAPER
The team implemented a 2007 algorithm by Joux, Naccache and Thome. The idea is simple and brutal: if a signing device will sign many inputs you choose, you can use those signatures to forge a signature on a new message you never asked for.
____________
THE ATTACK
The attacker gets the HSM to sign about 4 billion chosen inputs through the PKCS#11 interface. From those signatures, the team builds a valid signature on a target message. The private key is never extracted. The modulus is never factored.
____________
THE NUMBERS
The run took about 1,380 CPU core-years over about 5 months. That sounds huge until you compare it to the alternative: factoring that same 1024-bit key outright was estimated at 500,000 to 1 million core-years. Forgery was about 500x cheaper than factoring.
____________
THE DEVICE
This was not a toy key in a lab script. It was a real hardware security module doing what HSMs are supposed to do: sign. The weakness is not a bug in one product. It is what happens when an oracle gives an attacker too much signing freedom.
+++++++++++++++++++++
WHY IT MATTERS NOW:
If you still have 1024-bit RSA anywhere, especially in old HSMs, embedded devices, or legacy signing systems, your margin is gone. This does not break RSA-2048 or larger keys. It does kill the excuse that "1024-bit is old but still okay for low value data." Audit your keys. Check if any device hashes externally and signs attacker-chosen data. If yes, migrate and restrict that interface.
____________
THE AI + QUANTUM FUTURE:
This paper is the setup for what came next. Just 6 weeks later, DeepMind AI agents reran this same computation in 391 core-years, 3.5x cheaper, in 3.2 days. Humans gave about 20 short approvals. AI did the code and the execution. Now add quantum to the mix. Shor's estimates keep falling. AI keeps making classical attacks cheaper. The future is not one breakthrough that kills crypto. It is AI and quantum squeezing every old margin at the same time. Build for agility, not for one fixed assumption.
Source:
eprint.iacr.org/2026/2131
1
3
76
ππ¨π° πππ«π πππ―π ππ ππ¨π¨π€ππ?
ππππ π’ππππ ππ’ππππ πΆππ¦ππ‘πππππ¦π‘ππ πΈπππππ‘
βΈ If you deploy, audit, standardize, or migrate public-key cryptography, this is the scrutiny audit we have been missing.
Every deployed public-key scheme rests on a conjecture: some problem is hard.
We rarely ask the harder question: how hard has anyone actually tried to break it?
This study answers with a defensible order-of-magnitude comparison. Not a security level. Not a ranking of hardness. A measure of public cryptanalytic effort by assumption class.
Save this for your next PQC review, threat model, or standards discussion.
βββββββββββββββββββββ
β ππ;ππ
βββββββββββββββββββββ
β’ Lattices have now received more public cryptanalytic attention than ECDLP, by roughly 1.3x to 2.6x depending on counting method.
β’ Factoring + finite-field DLP still lead on cumulative effort.
β’ Effort is not security. But low scrutiny should raise the bar for trust.
β’ Classified effort is real, uncounted, and cannot be estimated from public budgets.
β’ AI inference budgets are not attack costs. Do not conflate them.
βββββββββββββββββββββββ
ππ β ππππ πππ ππππππππ
βββββββββββββββββββββββ
Assumption classes compared:
β ECDLP
β Structured + plain lattices: MLWE, LWE
β Syndrome decoding
β Comparators: factoring, isogenies, multivariate systems
Corpus: IACR ePrint, DBLP, OpenAlex, zbMATH. Screened by keyword, classified against a written rubric, second-pass reviewed.
β 4,348 included or borderline records
β 2,876 included items in the main effort categories
β 7,303 authorships grouped into about 3,112 identities
Unit of effort: a research-allocation year.
That is an estimate based on the share of a researcher's publications devoted to a topic. It is not a recorded year of work. Publishing only on a topic does not mean working on it full time.
That distinction matters for everything that follows.
ββββββββββββββββββββββ
ππ β πππ πππππππππ ππππ πππππππ
ββββββββββββββββββββββ
Lattice research exceeds ECDLP in the main cumulative views.
The lattice to ECDLP ratio ranges roughly from 1.3 to 2.6 across the study's counting and source assumptions. These are different measures and sensitivity choices, not a confidence interval.
β Main paper-count view crosses in 2017
β Author-output estimate crosses in 2018
Interpretation for practitioners:
Lattices are not new anymore. They have been the most actively attacked post-quantum family in the public literature for almost a decade. That sustained scrutiny is a feature, not a footnote, when we evaluate ML-KEM and related schemes.
It does not prove lattices are safe. It proves they have been looked at hard, in public, by many independent researchers.
βββββββββββββββββββββββ
ππ β ππππππππππ ππ
π
πππ: πππ πππππ πππππ
βββββββββββββββββββββββ
In the cumulative allocation model, factoring and finite-field DLP together still lead on accumulated allocation years, while lattices passed ECDLP in 2018.
Why this matters:
β’ Factoring has decades of accumulated algorithmic progress, records, and implementation effort behind it.
β’ ECDLP has had intense but more concentrated public effort.
β’ Lattices have had broad, fast-growing effort since the PQC process accelerated research.
When you compare assumptions, compare both the stock of effort and the flow of recent effort. A field can lead historically and still be overtaken in current attention.
βββββββββββββββββββββββ
ππ β ππππππππ ππ πππ π
πππππππ
βββββββββββββββββββββββ
Effort is one axis. Demonstrated computation is another.
The study defines a frontier gap in bits:
g = log2 W(target) - log2 W(largest public solve)
β A gap of 10 bits means about 1,000x the modeled work
β A gap of 35 bits means about 35 billion times the modeled work
Both endpoints use the same model. Only a shared, size-independent cost factor cancels. Memory, communication, and other costs can change with problem size.
Important nuance for lattices:
Lattice gaps cover one sieve call. The full ML-KEM-512 attack adds roughly nine bits in this model.
Do not read a single gap number as a security margin. Read it as: how far is the largest public demonstration from the deployed target, under one explicit model?
ββββββββββββββββββββββ
ππ β ππππππ πππππππ πππ πππππππππ
ββββββββββββββββββββββ
The study traces selected, source-checked mathematical bounds over time using a leading-term index: a simplified measure that drops lower-order factors.
β A fall in the index records an improvement in the selected model
β It does not measure security bits lost
β A flat line does not mean practical attacks stopped improving
Finite-field advances and the SIDH break are retained as sourced events. Their concrete estimates concern particular instances and units, so they are not joined to the index curves.
Lesson for protocol designers: algorithmic history is lumpy. A long quiet period is not evidence of stability. The SIDH case is a reminder that a single mathematical insight can reframe an entire family.
βββββββββββββββββββββββ
ππ β ππππ ππππ ππππ πππ πππππ
βββββββββββββββββββββββ
This is the section most summaries skip. It is the most important.
The literature estimates cover publicly documented work only: papers, preprints, theses, and published records.
Missing: unpublished failures, private research, and classified work.
If public effort were known, additional classified effort could be represented by an unknown multiplier:
H(public + classified) = (1 + k) x H(public), with k >= 0 unknown
Why k is not estimated:
One might hope to read classified headcount off public government budget documents, taking the NSA as the best-documented case. Official documents do not allow it.
β The National Intelligence Program is published only as a topline
β Every NSA line beneath it is classified
β The one unclassified NSA budget line covers the defensive mission
β The agency is excluded from federal workforce statistics that would otherwise count its mathematicians
The leaked FY2013 budget justification is the only document that pairs a dollar line with people: Cryptologic Math and IDA Research at $119M to $146M per year, and one cryptanalysis project with 240 civilian staff on $39M.
Dividing the research line by a plausible loaded cost gives roughly 300 to 500 full-time staff, uncertain by a factor of two, for a budget line rather than for cryptanalysts, as of 2012, with no split by assumption class. An official series for IDA cryptologic centers suggests such dollar conversions overstate research staff by about a factor of two.
Bottom line: we cannot bound classified effort by class from budgets. Anyone who claims otherwise is speculating.
βββββββββββββββββββββββ
ππ β ππ
π
πππ ππ πππ
ππππππ πππππππ + ππππ
βββββββββββββββββββββββ
Recent AI systems have produced new results in mathematics and cryptanalysis at disclosed costs. The study does not estimate an exchange rate between human and machine research.
Instead, it expresses historical effort H as an equivalent inference budget under an assumed productivity multiplier s:
D(s) = c x H / s, where c = $250,000 per research-year
At 10x, one estimated human research-year corresponds to $25,000 of inference. No multiplier is measured or preferred.
Read in reverse, a $100,000 inference budget represents 0.4, 4, or 40 assumed human-year equivalents at 1x, 10x, or 100x. These are assigned equivalents, not observed labor displaced by AI.
On HAWK:
HAWK's roughly $100,000 is API cost for discovery, not the cost of executing a key-recovery attack.
The ErdΕs paper reports more than $220,000 across its wider campaign. Individual successful-run costs are a different accounting boundary. Unsuccessful attempts and other project costs are not included in the ErdΕs averages.
And: human supervision, verification, model training, and tool compute are outside the inference allowance. The literature totals are not yet audited pre-discovery human labor, and existing literature also supplies tools to the AI.
Do not use these dollar scenarios as predictions of attack cost. Use them as sensitivity cases for how much inference would be needed to reproduce a given amount of historical literature effort under different productivity assumptions.
ββββββββββββββββββββββ
ππ β πππ ππππ πππππππ π
ππ πππ πππππππππ
ββββββββββββββββββββββ
β 1. Scrutiny is part of assurance. NIST selection is necessary, not sufficient. Ask how much independent, public effort an assumption has survived.
β 2. Diversify assumptions where you can. Do not bet an entire estate on one hardness problem with thin public scrutiny.
β 3. Track the frontier gap, not just the bit label. A 128-bit claim and a large demonstrated gap are different kinds of evidence.
β 4. Plan for reassessment. Attack history shows progress is not linear. Your migration plan should assume parameters, implementations, and even assumptions will need revisiting.
β 5. Treat AI results carefully. A disclosed discovery budget is not a break of a deployed scheme, and a paper count is not a proof of security.
βββββββββββββββββββββββ
ππ β ππππ ππ ππππ π ππππππππππππ: πππππππ
βββββββββββββββββββββββ
The study is unusually transparent about its limits, and that is why it deserves attention:
β’ Output share may substantially exceed time share. Career-adjusted views lower principal-class totals by roughly a quarter, but rely on assumed research fractions.
β’ No defensible numerical error bar is available.
β’ Scope excludes attacks based on power, timing, or fault leakage, and implementation or protocol flaws unrelated to the mathematical problem.
β’ It intentionally includes mathematical attacks with partial information, quantum algorithms, special or weak instances, and faster implementations. Those do not all transfer to ordinary deployed parameters.
β’ Abstract-based classification can admit out-of-scope work or misattribute mixed papers, which can overstate relevant scrutiny.
β’ Recall against selected seed papers is approximately 96% to 100% per class. That does not establish field-wide recall.
This is not a weakness. It is the correct way to present a literature-based estimate.
βββββββββββββββββββββββ
β³ ππππ ππ ππ ππππ
βββββββββββββββββββββββ
1. Read the methodology and audit trail, not just the charts.
2. Check the bibliography for your assumption class. Is a key paper missing or misclassified?
3. If something looks wrong, open an issue on the study repository. Accepted changes are recorded and the site is regenerated.
Cryptanalysis advances when scrutiny is public, reproducible, and corrected.
bitsofwork.org/
#Cryptography #Cryptanalysis #PostQuantum #PQC #NISTPQC #LatticeCryptography #ECDLP #MLKEM #SyndromeDecoding #CyberSecurity #InfoSec #Research
RSA-2048 JUST GOT CHEAPER TO BREAK. NOT TODAY, BUT THE CLOCK JUST MOVED.
On 28 Oct 2026, Alice and Bob published an end-to-end estimate for running Shor's algorithm on cat qubits. The headline number is wild: 22,593 physical qubits to factor RSA-2048 in 3.14 days.
It is a full compilation, from math to chip layout to schedule. And it is the lowest serious estimate we have seen.
_____________________
HERE IS WHAT HAPPENED, STEP BY STEP:
OCT - THE PAPER
Pappalardo and co-authors from Alice and Bob, Inria and others compiled Shor's algorithm for RSA, ECDLP and FFDLP down to physical operations on two cat-qubit architectures: repetition cat codes and LDPC cat codes.
THE NUMBERS
RSA-2048: 22,593 qubits, 3.14 days.
ECDLP on secp256k1: at most 30,000 qubits, about 1 hour.
FFDLP-512: about 6,700 qubits, 21 minutes.
Trade space for time: RSA-2048 in 1.25 hours on about 611,000 qubits.
THE ASSUMPTIONS THAT MAKE IT WORK
1 microsecond error-correction cycle, 10 microsecond reaction time, phase-flip probability of 5 x 10^-4 per cycle, and no bit flips. No bit flips means a bit-flip time of about 100 years. That is the hardest assumption in the whole paper.
THE REALITY CHECK
If you relax bit-flip time to about 1 hour with an extra distance-3 code, the RSA-2048 cost rises to about 45,000 qubits. Still low. Still theoretical. Still a preprint, not peer-reviewed.
_____________________
WHY IT MATTERS NOW:
No one is factoring your RSA-2048 key tomorrow. But every time this number drops, the migration deadline gets more real. If you still run RSA-2048 for long-lived data, you are betting that harvest-now-decrypt-later will not catch you. Start the inventory now. Move key establishment to ML-KEM first, then signatures.
This is where it gets scary and exciting. Cat qubits fix the noise bias in hardware. AI will fix the compilation. AI agents are already rerunning RSA attacks, optimizing circuits, and searching for better adders and factories. Quantum gives the speedup. AI gives the speed of iteration. Together, they compress years of cryptanalysis into weeks. The winners will not be the teams with the biggest quantum computer. They will be the teams with crypto-agility.
Source:
eprint.iacr.org/2026/2665
#QuantumComputing #Shor #RSA #PostQuantum #CatQubits #AI #CyberSecurity #CryptoAgility
π¬π§ How UK cyber law got here, 1990 to October 2026
The UK has no single cyber law. It was built in layers, one response at a time. Here's the arc π§΅
πΉ 1990: Computer Misuse Act
Made unauthorised access to computers a crime, after high-profile hacks. Amended in 2006 and 2015. Since 2015, serious damage (s.3ZA) carries up to 14 years, or life where lives are lost.
πΉ 2016: Investigatory Powers Act ("Snoopers' Charter")
Sets the rules for interception and state access to communications, including technical capability notices.
πΉ 2018: NIS Regulations and UK GDPR
NIS secures essential services and digital providers. The Data Protection Act 2018 and UK GDPR govern personal data.
πΉ 2021: Telecommunications (Security) Act
Telecoms security duties took effect in October 2022. Ofcom can fine up to 10% of turnover. It also gives government powers over high-risk vendors, a response to the Huawei row.
πΉ 2022: PSTI Act
Sets minimum security standards for connected consumer devices. In force since April 2024.
πΉ 2023: Online Safety Act
Ofcom regulates platforms. New offences cover false and threatening communications, cyberflashing and intimate image abuse, from January 2024. Child safety duties became enforceable in July 2025. Ofcom reports investigations into nearly 100 services.
πΉ 2025: Ransomware
In July 2025 the Home Office confirmed a planned ban on ransom payments by public bodies and critical infrastructure, plus mandatory reporting. It is not yet law.
πΉ 2025: Data (Use and Access) Act
Amends UK data protection law. Its changes are phasing in through 2026.
πΉ 2026: Crime and Policing Act
Royal Assent on 29 April. Courts can order domain names and IP addresses linked to serious crime suspended, including overseas. Broader corporate criminal liability applies from 29 June.
πΉ 2026: Cyber Security and Resilience Bill
Extends NIS to managed service providers, data centres and critical suppliers, with 24-hour incident reporting. Passed the Commons in June. In Lords committee in September. No Royal Assent yet.
πΉ 2026: Computer Misuse Act reform
The government has promised a statutory defence for researchers who report vulnerabilities. It was placed in a National Security Bill in the May 2026 King's Speech. Peers pushed for a review in August. Still not law.
πΉ Encryption fight
The Home Office issued technical capability notices to Apple. Apple withdrew Advanced Data Protection for UK users and challenged the orders at the Investigatory Powers Tribunal. A UK-only notice was reported in August 2026.
---
The takeaway: the UK is moving from a 1990 hacking law towards a regulator-led resilience model. Academics and industry say the Computer Misuse Act chills legitimate security research. Others warn that broad defences could help criminals. Online safety critics raise free-speech concerns. Parliament will decide the balance.
#UKCyber #CyberSecurity #CyberLaw #OnlineSafety #DigitalRights #DataProtection
1
2
133
THE 48-YEAR-OLD CODE THAT SURVIVED EVERYTHING JUST GOT CRACKED OPEN
For 48 years, Classic McEliece was the "boring but safe" post-quantum choice. Built on binary Goppa codes in 1978, it survived while others fell. In Aug-Oct 2026, that story changed. Not with a practical break, but with a margin collapse that moved a government.
_______________
HERE IS WHAT HAPPENED, STEP BY STEP:
AUG - THE DISTINGUISHER
Ghoshal, Ishai, Jain and Sun showed a quasipolynomial test that can tell a McEliece public key apart from a random matrix. For the first time, structure was visible at a cost below generic decoding.
SEPT - THE KEY RECOVERY
Stephen Weis of Anthropic cut the cost of one run to 2^89 to 2^98 bit operations, down from 2^114 to 2^124. He also gave two ways to recover the secret key, and solved the toy TII-253 challenge that was previously unsolved.
SEPT - THE CONFIRMATION
Saarinen solved TII-254, the hardest solved challenge under the original metric. This was no longer one paper. It was a cascade.
OCT - THE POLICY SHOCK
Germany's BSI said: do not use Classic McEliece for new developments. This came just 4 months after ISO standardized it in June 2026. BSI was clear: no practical attack yet, and hybrids keep their classical protection.
_______________
WHY IT MATTERS NOW:
If you are building a new system in 2026-27, "ISO-standardized" is not enough. You need to check what national guidance says. Existing hybrids are not in emergency mode. New builds need FrodoKEM, ML-KEM, or HQC instead.
THE AI + QUANTUM FUTURE:
Weis prepared his paper with Claude. AI did not invent the math, but it accelerated the iteration. Now imagine this speed applied to quantum-era cryptanalysis, where Shor estimates keep falling and AI agents are already rerunning RSA attacks. The lesson is crypto-agility: build systems you can swap, because advice will keep changing.
Sources:
eprint.iacr.org/2026/1630
eprint.iacr.org/2026/1984
#PostQuantum #McEliece #Cryptography #QuantumComputing #AI #CyberSecurity #BSI #CryptoAgility #PakCrypt
The era of hacktivism as mere website defacements and DDoS attacks is dead. Welcome to the age of Crypto Warfare.
The digital battlefield has evolved, and the new frontier is the blockchain. We are witnessing a profound shift where ideologically or geopolitically motivated actors are executing multi-million dollar financial heists with the precision of state-sponsored Advanced Persistent Threats (APT).
Here is your technical deep-dive into the weaponization of cryptocurrency in geopolitical conflicts, the blurring lines between crime and hacktivism, and the urgent mandate for blockchain security. π§΅π
**1οΈβ£ THE EVOLUTION: From Script Kiddies to Strategic Hacktivists**
Historically, hacktivism was noisy but low-impact: taking down a website for a few hours to make a political statement. Today, "patriotic hacker" collectives operate with the sophistication, funding, and operational security (OPSEC) of nation-states. Their goal is no longer just visibility; it is tangible economic degradation and the disruption of adversary funding streams.
**2οΈβ£ THE CASE STUDY: The Nobitex Paradigm**
A defining moment in this shift was the reported breach of Iranβs largest cryptocurrency exchange, Nobitex, by the Israeli-aligned hacktivist group "Predatory Sparrow," resulting in the alleged drain of ~$90 million in digital assets.
This was not a random cybercrime. It was a strategic strike against a *national* financial infrastructure. By targeting an exchange often used to circumvent international sanctions, the attack served a dual purpose:
π₯ **Economic Disruption:** Inflicting direct, massive financial damage on a key pillar of the target nation's digital economy.
π₯ **Geopolitical Messaging:** Demonstrating that no digital asset is safe, and that the "sanctions-proof" nature of crypto can be weaponized against its users.
**3οΈβ£ THE BLURRING LINES: Cybercrime vs. State-Aligned Hacktivism**
This trend creates a massive attribution and legal gray zone. When a hacktivist group drains an exchange, are they criminals or combatants?
π **The "Robin Hood" Mask:** Groups often claim their actions are for a "greater good," masking sophisticated exploitation of smart contract vulnerabilities, supply chain compromises, or hot-wallet OPSEC failures.
π **Plausible Deniability:** Nation-states can leverage these aligned groups to achieve strategic financial disruption without direct, attributable state involvement, complicating diplomatic and legal responses.
**4οΈβ£ THE GLOBAL DEFENSE MANDATE: Hardening the Blockchain**
Cryptocurrency exchanges and national digital asset platforms are now prime targets in geopolitical conflicts. Defending them requires moving beyond basic cybersecurity into specialized blockchain defense:
π **Rigorous Key Management:** Mandatory adoption of Multi-Party Computation (MPC) or hardware-backed Multi-Signature (Multi-Sig) schemes for all hot and warm wallets. No single point of failure.
π§ **Deep Cold Storage:** Keeping the vast majority of national or exchange reserves in air-gapped, geographically distributed cold storage, immune to remote network breaches.
π **On-Chain Behavioral Analytics:** Deploying real-time blockchain monitoring tools to detect anomalous transaction patterns, instantly freezing or flagging funds moving to known mixer services (like Tornado Cash) or sanctioned wallets.
**5οΈβ£ CALL TO ACTION: Securing the Decentralized Future**
To smart contract auditors, blockchain forensic analysts, and cybersecurity professionals worldwide: **The stakes in digital asset security have never been higher.**
____________
We need defenders who understand both the cryptography of the blockchain and the geopolitical motives of the adversaries targeting it. Master on-chain investigation, contribute to open-source Web3 security tools, and advocate for rigorous, audited financial infrastructure. The integrity of the global digital economy depends on it. πππ‘οΈ
π **READ MORE & DIVE DEEP:**
π **Chainalysis: The Crypto Crime Report (Geopolitical Hacks & Sanctions Evasion):** chainalysis.com/reports/2024β¦
π‘οΈ **Elliptic: Navigating Geopolitical Risk in Digital Assets:** elliptic.co/blog/geopoliticaβ¦
#CryptoWarfare #Hacktivism #BlockchainSecurity #CyberSecurity #InfoSec #ThreatIntelligence #Web3Security #Geopolitics #APT #DigitalAssets #CyberDefense











