geeknik
banner
geeknik.bsky.social
geeknik
@geeknik.bsky.social
260 followers 160 following 5.8K posts
Human Founder->Deep Fork Cyber ⚔️ Security Researcher | AI Glitch Prophet Open Source Instigator | Pepper Fiend Coloring outside the lines since forever. “I don’t push commits—I push cognitive breakdowns.” Latest: https://gtr.dev
Posts Media Videos Starter Packs
macOS sorts by ASCII necromancy; Linux obeys an 85 612-line ISO scripture. Same locale, different cult—your CI passes on one, shuffles on the other. Burn the collation idols.
blog.zhimingwang.org...
Google Drive now ships nation-state malware with 2-day delivery.
Open the PDF, get pwned, upload your secrets back to Google.
Cloud: “Don’t be evil.” Customers: “Hold my password647842.”
archive.ph/pGryv
Airports: where TSA gropes your body while script-kiddies grope the PA.
They hijack the speakers, we still board the same planes.
Security theater gets a laugh track—Free Palestine, $15 Wi-Fi.
Pro-Hamas hackers hijack airport loudspeakers across North America,...
Videos showed unauthorized recordings echoing through Harrisburg International Airport in Pennsylvania and Kelowna International Airport in Canada.
nypost.com
They’re selling you a 50-piece LEGO box labeled “Civilization,” but the bricks are still made in Shenzhen and the instruction PDF needs a firmware update. Print the tractor, pirate the farm—yet your coffee still ships colonized.
Meet the man building a starter kit for civilization
Marcin Jakubowski is compiling a DIY set of society’s essential machines and making it open-source.
www.technologyreview.com
10,000 satellites, 1,400 already dead—space isn’t getting “connected,” it’s getting littered with $500K fireworks that take 5 years to self-delete. We traded the sky for buffering bars.
SpaceX launches 10,000th Starlink internet satellite
About 1,400 have been decommissioned.
www.theverge.com
5 rounds, 64 bits, 485 LUTs—your nudes now encrypted by a cipher smaller than the JPEG header. Nature peer-reviewed the lock; the glitch keeps the key.
An optimized novel lightweight block cipher for image encryption
Scientific Reports - An optimized novel lightweight block cipher for image encryption
www.nature.com
Obfuscation = cosmic funnel: pour in the worst P-vs-NP despair, out pops perfect crypto.
So either SAT is easy… or reality ships with a DRM’d rootkit called “math.”
Cryptography meets worst-case complexity: Optimal security and more from iO and worst-case assumptions
We study several problems in the intersection of cryptography and complexity theory based on the following high-level thesis. 1) Obfuscation can serve as a general-purpose worst-case to average-case reduction, reducing the existence of various forms of cryptography to corresponding worst-case assumptions. 2) We can therefore hope to overcome barriers in cryptography and average-case complexity by (i) making worst-case hardness assumptions beyond $\mathsf{P}\neq \mathsf{NP}$, and (ii) leveraging worst-case hardness reductions, either proved by traditional complexity-theoretic methods or facilitated further by cryptography. Concretely, our results include: - Optimal hardness. Assuming sub-exponential indistinguishability obfuscation, we give fine-grained worst-case to average case reductions for circuit-SAT. In particular, if finding an $\mathsf{NP}$-witness requires nearly brute-force time in the worst case, then the same is true for some efficiently sampleable distribution. In fact, we show that under these assumptions, there exist families of one-way functions with optimal time-probability security tradeoffs. Under an additional, stronger assumption -- the optimal non-deterministic hardness of refuting circuit-SAT -- we construct additional cryptographic primitives such as PRGs and public-key encryption that have such optimal time-advantage security tradeoffs. - Direct Product Hardness. Again assuming $i\mathcal O$ and optimal non-deterministic hardness of SAT refutation, we show that the ``(search) $k$-fold SAT problem'' -- the computational task of finding satisfying assignments to $k$ circuit-SAT instances simultaneously -- has (optimal) hardness roughly $(T/2^n)^k$ for time $T$ algorithms. In fact, we build ``optimally secure one-way product functions'' (Holmgren-Lombardi, FOCS '18), demonstrating that optimal direct product theorems hold for some choice of one-way function family. - Single-Input Correlation Intractability. Assuming either $i\mathcal O$ or $\mathsf{LWE}$, we show a worst-case to average-case reduction for strong forms of single-input correlation intractability. That is, powerful forms of correlation-intractable hash functions exist provided that a collection of \emph{worst-case} ``correlation-finding'' problems are hard. - Non-interactive Proof of Quantumness. Assuming sub-exponential $i\mathcal O$ and OWFs, we give a non-interactive proof of quantumness based on the worst-case hardness of the white-box Simon problem. In particular, this proof of quantumness result does not explicitly assume quantum advantage for an average-case task. To help prove our first two results, we show along the way how to improve the Goldwasser-Sipser ``set lower bound'' protocol to have communication complexity quadratically smaller in the multiplicative approximation error $\epsilon$.
eprint.iacr.org
Sheaves: AMD CPUs now +126% faster by hiding RAM from the kernel that thought it owned it.
Reality check: your PC is just a turf war between cache layers you never met.
Linux's New "Sheaves" Per-CPU Caching Layer Showing Massive Wins For AMD Performance
Earlier this week I wrote about Sheaves as an opt-in, per-CPU array-based caching layer likely coming for Linux 6.18
www.phoronix.com
IonQ brags it only sampled 128 out of 10^108 configs—so the “quantum grid fix” is literally 99.999…% ignored multiverse. Your lights stay on because the algorithm ghosts infinity.
IonQ, Oak Ridge Researchers Use Quantum-Classical Algorithm to Solve Power Grid Problem
IonQ and Oak Ridge National Laboratory developed an algorithm to solve the complex unit commitment problem in power grid operations.
thequantuminsider.com