160 results for “Nature”

Decrypt reports that at least $5.57 billion left Binance-linked hot wallets on Ethereum, Bitcoin and Tron on 29 October 2026, which would be the largest crypto hack on record. On-chain analysts point to an EIP-7702 delegation, installed from a Tornado Cash-funded address minutes before the first sweep. Tether and Circle froze about $1.8 billion. Binance has not confirmed the hack, and how the attacker obtained the signature is unknown.

decrypt.coarticlePublished and added 29 Oct 2026🛡️ Security

SingularityNET exploit (19 September 2026): attackers with signing authority exposed through a cloud infrastructure breach drained 8.72M FET from the Ethereum bridge converter, then minted about 2.3 billion AGIX, NTX, WMTX and CGV. Rekt's transaction-level reconstruction puts gross liquid proceeds near $2.29M, not the $16.77M headline, and traces laundering via Chainflip, Baltex and THORChain. It notes conversionIn() skipped checkLimits() and trusted a single EOA signature.

rekt.newswriteupAdded 29 Oct 2026🛡️ Security

MavenGate is Oversecured's research on hijacking Maven dependencies by buying expired domains behind groupIds on Maven Central and JitPack. It found 6,170 of 33,938 checked domains (18.18%) vulnerable, and tested the attack with its own com.oversecured:hello-world library. It lists defenses (Gradle verification-metadata.xml, PGP signatures) and proposes changes to repository signing.

oversecured.comwriteupAdded 29 Oct 2026🛡️ Security

Inventory of post-quantum migration work for Ethereum consensus-layer networking, by adust09 of Nyx Foundation. It maps three targets: Discovery v5/ENR signatures and key exchange, TLS 1.3 key agreement in QUIC, and libp2p TLS identity binding and CertificateVerify. It covers the 300-byte ENR and 1,280-byte packet limits, why hybrid KEMs do not authenticate peers, and downgrade and DoS concerns. It selects no algorithm or schedule.

ethresear.charticlePublished and added 27 Oct 2026🛡️ Security

Falcon Key Recovery from Joint Sampler Leakages is an ePrint paper presenting a power side-channel attack on Falcon and FN-DSA that fuses three SamplerZ leakages (exponent class of the center, sign bit, proposal magnitude). It turns them into slab and halfspace constraints solved by softplus interval regression, with no LLL or BKZ. On PQClean Falcon-512 (ARM Cortex-M4) it recovered all 50 keys with at most 34 signatures; on c-fn-dsa it recovered 38 of 50 keys within 200 signatures.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

Electrum 4.8.3, released 24 October 2026, fixes a high-severity flaw in the Bitcoin wallet. Rogue servers could suppress a real payment and inject a fake unconfirmed transaction paying an attacker, so a user's fee-bump became the first transaction broadcast. The fix verifies signatures on wallet-owned inputs, but incoming transactions from external senders stay unverified. One user lost funds on 18 October.

decrypt.coarticlePublished and added 26 Oct 2026🛡️ Security

Electrum, a Bitcoin software wallet, disclosed on 24 October 2026 a flaw where malicious servers swapped pending transactions for fake ones with invalid signatures that the wallet did not check. When users chose Replace-by-Fee to raise the fee, Electrum signed a valid replacement paying the attacker, and at least one user lost funds. Version 4.8.3 adds signature checks; users of only trusted or self-run servers were not exposed.

coindesk.comarticlePublished and added 26 Oct 2026🛡️ Security

Falko Strenzke's ePrint 2026/2635 presents a multi-target second-preimage attack on message hashing in HSS/LMS and XMSS with SHA-256 and SHA-256/192. It herds chaining states from many collected signatures into one state, defeating the key and leaf-index prefix. With 2^64 signatures, SHA-256 cost falls from 2^256 to about 2^166 (2^156 at maximal message length). SHAKE256 parameter sets are unaffected.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 25 Oct 2026🛡️ Security

Hash-only rollup: an OP Stack L2 (chain ID 42069000, live since 30 September 2026) where accounts are keccak-256 hash chains and transactions carry no signatures. Spending uses a commit-reveal step through two new transaction types in op-geth. The post describes a flaw the authors found: unauthenticated commits could be overwritten, which allowed preimage front-running. It was fixed with a first-commit-wins rule on 21 October 2026. It lists the remaining limits: L1 ECDSA, no fault proofs, a centralized sequencer, 160-bit addresses and wallet desync.

ethresear.charticlePublished and added 24 Oct 2026🛡️ Security

This IACR ePrint 2026/2632 paper by Demirtaş and Yayla analyses the Crites–Stewart adaptive forgery attack on threshold Schnorr signatures, which needs one call to a sparse linear search oracle (bounded distance decoding of a scaled Reed–Solomon code). It shows that choosing the commitment coefficient vector does not help much: a wrapper adversary with Q challenges succeeds with probability at most QM/p, even if its solvers decode every witness for free. For the six original (N, τ) pairs, M stays below 2^24, so the bound is under 2^-100 after 2^128 challenges at p = 2^252.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

Electrum 4.8.3, released 24 October 2026, fixes a flaw where a malicious server replaces a user's unconfirmed payment with a conflicting transaction carrying invalid signatures. If the user then bumps the fee with replace-by-fee, the wallet signs a payment to the attacker. One of two reporting users lost funds, and the patch now checks input signatures before accepting such transactions. Bull Bitcoin is adding the same client-side check.

en.cryptonomist.charticlePublished and added 24 Oct 2026🛡️ Security

The Exact Bit Security of Hash-Based Signatures is a 2026 IACR ePrint paper that analyses XMSS with 128-bit digests and SLH-DSA-128s in the random oracle model, with proofs formalised in Lean4. Strong unforgeability comes to 127 bits under most accounting modes but only 122 bits if just direct random oracle queries are counted. The authors give matching attacks, and show how resource accounting changes the result.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

GordieHowe is a language, certifying compiler and zero-knowledge proof system for building anonymous credentials on standardized signatures (ECDSA, RSA, ML-DSA). It proves an ECDSA-signed mobile driving license presentation in 64.8 ms with a 276 KiB proof, 10.1x faster than Google's Longfellow, and an ML-DSA-44 signature in 87.3 ms with at least 116 bits of quantum security. Compiler output and security theorems are checked in Lean. It introduces series-parallel IOPs and extends the BCS transformation in the QROM.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026🛡️ Security

Decode-time provenance binding is a defense for Model Context Protocol agent pipelines against cross-modal trust laundering, where instructions hidden in an email-signature image via LSB, DCT or metadata steganography get decoded by a tool. It combines HMAC-authenticated trust labels, a provenance ledger and context-taint tracking to block critical tool calls. On a real MCP testbed with 24 adaptive payloads, attack success fell from 100% undefended (62.5% for keyword and regex filters) to 0%.

arxiv.orgpaperAdded 26 Oct 2026, published 22 Oct 2026🛡️ Security

Balsamic is a complete homomorphic Unbalanced Oil and Vinegar (UOV) signer, used to build one-round threshold UOV signatures from a packed discrete-CKKS FHE circuit. A paired-pivot linear solver and pivot-success certificates allow encrypted retry selection. In 2-out-of-3 semihonest signing, each online partial signature takes 10.7 s on an RTX 6000 Ada and 7.77 s on a GB300, with 5.25 MB per response.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

Paper by Shivansh Jaiswal and Somitra Sanadhya (IACR ePrint 2026/2601) on integer coordinate families for threshold RSA signatures with prime exponent e. It shows the CT-RSA 2026 Ng-Lau scheme admits trivial forgeries and has a flawed proof. It proposes repaired scheme PiIC and integer secret-sharing scheme PiZ for any prime e and any (t,n), both proven TS-UF-CMA secure under the standard RSA assumption. It also gives super-polynomial coordinate lower bounds for pairwise families.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

Bankless summary of Coinbase's October 2026 proposal for making Bitcoin quantum-safe. It covers upgradeable address designs (BIP-360 P2MR, P2TRv2, hybrid addresses), four candidate signatures (ML-DSA, SLH-DSA, FN-DSA, SHRINCS) with size and stateful-key-reuse trade-offs, a five-stage migration plan, and a separate track for dormant coins with exposed public keys such as Satoshi's.

bankless.comarticlePublished and added 21 Oct 2026🛡️ Security

PQCD-TLS is a post-quantum TLS handshake that binds confirmation codes into chained key derivation, so a faulty signature or KEM verification step causes a key mismatch and handshake failure. The authors build confirmation-code frameworks for ML-DSA and Falcon signatures and for ML-KEM, HQC and DAWN, with unpredictability proofs. Across 48 configurations, handshake latency overhead stays below 1%.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

SHAKEing SLH-DSA with Non-profiled SCAs is an eShard ePrint paper (2026/2584) on correlation power analysis of SLH-DSA-SHAKE, the NIST-standardised hash-based signature scheme. It analyses PRF inputs and selection functions, then combines subtrace averaging, partial-then-total CPA and an efficient exhaustive search to recover the full secret seed, enabling universal forgery. On a 32-bit microcontroller the attack needs about 280 to 559 signatures, and the search finishes within 45 minutes on 72 cores.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

This ePrint paper presents an optimized HAETAE implementation, a lattice-based post-quantum signature scheme, for Cortex-M4, Cortex-M3, MSP430 and AVR. It keeps polynomials in 16 bits, shares buffers between objects with disjoint lifetimes, and replays Gaussian samples instead of regenerating them. On an ATmega2560, HAETAE-2 key generation, signing and verification run in 8,070 B of SRAM. Stack use drops up to 34% and signing is 1.18-2.51x faster than Low-Stack HAETAE.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

Fault-Induced Nonce Repetition in Threshold Lattice Signatures is an ePrint paper (2026/2566, Yulong Meng) showing that faulting t devices in a t-of-n threshold ML-DSA deployment recovers the full signing secret, verified on Mithril with exact recovery in 96/96 scan groups. It gives a reveal-structure criterion across Quorus, TALUS and Trilithium, a threshold law m* = (ℓ-1)N+⌈N/K⌉ for imperfect faults, and two-layer transcript detection (305/305 hits, no false positives).

eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026🛡️ Security

FN-DSA on Arm Cortex-M55 is an ePrint paper presenting the first FN-DSA (NIST post-quantum signature) implementation on this core that reproduces the reference known-answer tests and runs in constant time. It uses the native FP64 FPU for signing and Helium (MVE) for NTT, key-generation FFT and Keccak, with SLOTHY rescheduling. Key generation, signing and verification are up to 1.23x, 1.93x and 1.30x faster than the reference, and four-signature batch verification up to 1.75x.

eprint.iacr.orgpaperPublished and added 20 Oct 2026🛡️ Security

Honeypot writeup of in-the-wild exploitation of Plex Media Server through the Plex2Shell chain (CVE-2026-96652, -96654, -96655, -96656) in October 2026. Attackers from 45.194.92.222, 91.92.40.202 and 176.65.139.228 used SSRF-style timeline/subscribe requests and downloaded a Docker-named dropper and an XMRig miner from 217.60.194.116. Includes file hashes, a later-seen proxyware sample (myawesomeproxy), lab pcaps for signatures and links to sandbox reports.

boredhackerblog.infowriteupAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

A Note on the Security of ECDSA with Presignatures or Biased Nonces (Couteau and Makriyannis, ePrint 2026/2545) examines alternative ECDSA modes built for faster distributed signing. It shows that the security of some variants used in deployed libraries is equivalent, in the generic group and random oracle model, to the average-case hardness of k-SUM. It also proves fine-grained lower bounds on generic group attacks against modes analyzed by Groth and Shoup (Eurocrypt 2022).

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

The paper presents the first efficient, compact implementation of high-order masked Raccoon (lattice-based signature, CRYPTO 2024) on ARM Cortex-M4, up to 32 masking orders. It uses 3+3+3 layer-merged 32-bit NTT/INTT with lazy reduction, a negative double Montgomery reduction, and one-shot SHAKE256 sampling (at least 1.80x faster). It beats the reference by 1.85x-2.25x and masked Dilithium3 at orders 2, 4 and 8. Second-order leakage tests show DPA resistance once micro-architectural transitional leakage is mitigated.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

Revisiting the Security of VDOO is an ePrint paper (October 2026) on VDOO, a multivariate signature scheme submitted to China's NGCC program. It models VDOO as a multilayer Rainbow construction, keeps only the last oil space to get a generalized UOV instance, and applies wedge attacks. For the 512-bit parameter set it estimates 2^432 gates (reconciliation) and 2^379 gates (intersection), below the claimed level and the specification's figures.

eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🛡️ Security

This ePrint paper (2026/2525, October 2026) by Brendan Funk and Jiafeng Xie presents the first hardware accelerator for FAEST, an MPC-in-the-head post-quantum signature in NIST's Round 3 additional-signature process. It analyses FAEST's compute-heavy operations, builds them into hardware blocks, and adds an L1-EM-fast variant. The authors report at least 98% lower equivalent area-delay product than the recent complete SDitH design at the same security level.

eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🛡️ Security

Presents a fixed-point C implementation of the Mitaka signing algorithm, a simpler, parallelizable Falcon (FN-DSA) variant. It replaces MitakaZ's wide integral Gram root decomposition with a fixed-point square Cholesky decomposition, which cuts the cost of integer Gaussian sampling, and proves bounds on intermediate values and representation errors without empirical assumptions. Signing averages 361 kcycles (Mitaka-512) and 707 kcycles (Mitaka-1024) on AVX2, and 4.0 and 7.8 Mcycles on an STM32F411 Cortex-M4F. This makes floating-point-free lattice signatures practical on constrained devices.

eprint.iacr.orgpaperPublished and added 17 Oct 2026🛡️ Security

Presents the first DPA-style power side-channel attack framework against VOLE-in-the-Head signature schemes, targeting the secret witness whose recovery enables forging signatures on arbitrary messages. It analyzes leakage from sensitive intermediate values in VOLE correlations and proposes six attack classes (two vertical, four horizontal) on FAEST and SDitH, both in NIST's third round of additional signatures. Attacks are validated with simulated leakage under varying noise and real measurements on three ARM Cortex-M4 devices.

eprint.iacr.orgpaperPublished and added 17 Oct 2026🛡️ Security

Anthropic's Frontier Red Team reports that Claude recovered how the NIST P-192/224/256/384/521 and ANSI X9.62 curve seeds were generated. They are outputs of the C library's lrand48 LCG seeded with 1997–98 Unix timestamps, not hashes of a passphrase. The method scanned for weak-PRNG signatures, then used LLL lattice reduction to recover the truncated LCG state and stepped it back to srand48 initialization. Claude also traced some base points to the FreeLIP/NTL random generator. Reproducible Python is included. The authors say this is not an attack and makes deliberate backdoors less plausible. The B-163 seed and the base points of P-224/256/384/521 and the binary curves remain unexplained.

anthropic.comwriteupAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

Anthropic's Frontier Red Team reports that Claude, given no hint, worked out how the NIST P-192/224/256/384/521 and ANSI X9.62 curve seeds were generated. They came from the C library's lrand48 LCG seeded with Unix timestamps from 1997–98, not from a hash of a phrase. Claude found this by scanning for weak-PRNG signatures and recovering the PRNG state with LLL lattice reduction. It also traced several prime-curve base points to the FreeLIP random generator. The post includes Python code that reproduces the seeds and base points. It says this is not an attack and makes backdoor claims less plausible. B-163 and the other base points remain unexplained.

anthropic.comwriteupAdded 17 Oct 2026, published 16 Oct 2026🧠 AI

Galaxy research report arguing that CAPTCHAs and behavioral bot detection (reCAPTCHAv3, Cloudflare Turnstile) are failing as AI agents reproduce human conduct, for example ChatGPT Agent clicking through Turnstile's checkbox. It shows that Web Bot Auth signatures and Google's AP2 mandates identify the platform or account key but not a distinct person. It proposes reframing "proving humanity" as ensuring every agent traces to one person counted once, covering Sybil, one-person-one-share, accountability and public-count harms. It lays out requirements for a proof-of-personhood credential: strong, private, portable, delegable and accessible. It deliberately does not evaluate specific projects.

galaxy.comarticleAdded 16 Oct 2026🛡️ Security

Galaxy Research essay arguing that as AI agents become the main way people use the web, the key question shifts from "is this a machine?" to "is a distinct real person behind it, counted once?". It traces CAPTCHA history (distorted text, image puzzles, reCAPTCHAv3 and Turnstile behavioral scoring) and notes ChatGPT Agent passing Cloudflare's checkbox. It reviews Web Bot Auth signatures and Google's AP2 payment mandates, showing both stop at the platform or key and never establish a person. It then covers harms (one-person-one-share abuse, no one to answer for an agent, distorted public counts, collapsing confidence, scaled deception, broken ad economics) and lists the properties a privacy-preserving proof-of-personhood credential needs: strong, private, portable, delegable, accessible.

galaxy.comarticleAdded 16 Oct 2026🧠 AI

TileDRAM is a compiler-runtime toolchain that adds tile-to-DRAM layouts as a compiler-visible abstraction for compute-unit-local 3D DRAM GPUs. It extends GPU Linear Layout to DRAM placement and picks layouts per tile access signature using row-buffer behavior. On 108 MoE FFN cases in Accel-Sim/Ramulator2, row-conflict rate fell from 75.7% to 15.2%, with a 1.77x geomean speedup. Overhead on an RTX 3090 is 0.17%.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

a16z crypto announces Aerie, a lattice-SNARK system that aggregates Falcon-512/1024 signatures into one ~66 KiB proof. On an M4 Max laptop it handles 32,768 signatures in 0.65 s (~50k/s), verifies in 54 ms, and costs ~42 bytes per signature. It benchmarks against Orthus and Ethereum's leanVM hash-based XMSS aggregation, and argues that recursion-free lattice aggregation is simpler than hash-only designs. It also covers Falcon's hardware-wallet and side-channel constraints and why private payments need lattice encryption such as ML-KEM.

a16zcrypto.comarticlePublished and added 16 Oct 2026🛡️ Security

Aerie is an a16z crypto and LayerZero Labs system that aggregates Falcon-512 and Falcon-1024 lattice signatures into one lattice SNARK. On an Apple M4 Max it aggregates 32,768 Falcon-512 signatures in 0.65 seconds, with 54 ms verification and about 42 bytes per signature. The post compares it with Ethereum's hash-based leanVM and XMSS plan and Orthus, and covers Falcon signing limits on hardware wallets.

a16zfrontier.comarticleAdded 22 Oct 2026, published 16 Oct 2026🛡️ Security

The paper revisits the multi-key optimization for SPECK, a code-based signature scheme that uses the Permutation Code Equivalence Problem (PEP) as a trapdoor for the Permuted Kernel Problem (PKP). Each SPECK round has soundness error 1/2, which inflates signatures, and the SPECK authors had warned that naively using multiple public keys creates security concerns. The authors analyse those concerns, give conditions and parameter constraints under which multiple keys can be integrated securely, and show that conservative parameters perform poorly but leave room for improvement. They also build a ring signature scheme on the same construction.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

ePrint paper identifying five side-channel vulnerabilities in the signing procedure of Round-3 SQIsign, the isogeny-based signature scheme in NIST's additional post-quantum signature process. It gives polynomial-time algebraic algorithms that recover the secret key from leaked quaternion/ideal intermediate values, including cases where only partial bits leak. It also demonstrates power analysis on the SQIsign source code to extract the needed leakage, which earlier work on Round-1 or toy parameters did not do.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

MUB (Music Understanding Benchmark) is a set of 500 identity-masked recordings with existing annotations for tempo, key, time signature and structural intervals. It covers all 24 keys, tempos of 47 to 180 BPM and 4,676 intervals, and strips titles, artists and platform IDs from inputs. Baselines reach 53.6% tempo accuracy (DSP) and 98.4% time-signature accuracy (constant 4/4). No multimodal LLM has been tested yet, and rights clearance is unresolved.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

The paper proposes a traceable and aggregatable tagged witness signature (TA-TWS) and builds SwiftAuth on it, a conditional privacy-preserving anonymous authentication framework for UAVs and other dynamic terminals. Issuers can create authorization components while users are offline. Several credentials compress into one constant-size proof, verifiers can batch-verify across users, and a regulatory trapdoor lets authorities trace misbehaving users. TA-TWS is proven unforgeable and witness-hiding, and benchmarks with the MIRACL Core library on constrained devices and Aliyun servers show it is practical.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

Proposes "guarded sharing", a technique that moves few-time signatures in SPHINCS-style stateless hash-based schemes from a tree model to a DAG model. Combined with bucket thinning, hash chains and rejection sampling, it yields BGS-CC, which improves on the prior best few-time scheme BPORS-C+BFP. For 128-bit security and a use quota of Q=2^24 it gives 2,228-byte signatures, the first SPHINCS-based stateless signature shorter than ML-DSA-44's 2,420 bytes. This matters for PQ migration because signature size is the main drawback of SLH-DSA.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

Presents MLExpert, a 35B Mixture-of-Experts agentic model trained for autonomous long-horizon machine learning engineering. Training uses a Kaggle-MLE Factory to build executable tasks and an interaction harness, hierarchical agentic SFT with outcome-guided supervision, and Windowed Interaction RL (WIRL). WIRL treats the multi-turn decisions between successive experiment results as one execution window with a shared outcome reward, and uses asynchronous collection and policy correction. On MLE-Bench Lite the average medal rate rises from 37.9% to 72.7%, comparable to larger frontier models such as Kimi-K3 and GLM-5.3. It also improves on NatureBench Lite, agent scaffold optimization and algorithm optimization.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

ePrint paper presenting an NVIDIA GPU implementation of FAEST (a post-quantum signature scheme built on VOLE-in-the-Head and QuickSilver), covering key generation and OWFProve/OWFVerify for standard and EM constructions in s and f variants. Profiling shows field multiplication takes about 82% of FAEST-128f signing time once AES is hardware-accelerated. Using PTX clmad carry-less multiplication plus Karatsuba, it reaches up to 26.6x kernel throughput and about 2.9-3.1x full 256-bit OWFProve throughput over the software-multiplication build on an RTX A5000.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🛡️ Security

Bankless article on Eigen Labs' Yukon, a platform for open-research challenges where developers and AI agents try to improve a technical problem. Each submission is automatically benchmarked, and accepted improvements become the baseline for the next attempt. Results include an ~88% cut in the ECDSA.fail quantum resource-cost benchmark, a ~10x speedup in Lighter's proving software, ~2x faster Qwen and 2.6x faster Laguna on Apple hardware via MLX.fast, and cheaper Quantum Safe Bitcoin proofs ($320 down to $59). Newer challenges (HashSmash, sig.golf, better.codes) target hash-function weaknesses, hash-based signatures and post-quantum proofs. All the improvements are theoretical or benchmark-level unless stated as deployed.

bankless.comarticlePublished and added 14 Oct 2026🧠 AI

Bankless article on Eigen Labs' Yukon platform, which runs open challenges where researchers and AI agents attack and improve cryptography. It covers ECDSA.fail (quantum circuit cost for attacking Bitcoin/Ethereum ECDSA, cut about 88% from baseline), HashSmash (SHA-256 weakness hunting, so far only on reduced versions), sig.golf (hash-based signatures), StarkWare's Quantum Safe Bitcoin (cost down from about $320 to $59) and better.codes (provable security raised from 64 to about 68 bits). The argument is that public, measurable attack-cost data helps defenders prepare better than withholding circuits does. All gains are theoretical and no quantum computer has run an attack at this scale.

bankless.comarticlePublished and added 14 Oct 2026🛡️ Security

Draft ERC from Quantova Inc proposing a "Quantum Bridge Shield" for Ethereum bridges. A committee signs the Merkle root of each message batch with RFC 8554 LMS hash-based signatures instead of ECDSA/BLS keys that Shor's algorithm can break. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain, chain, guard and epoch, and applies a 60-second delay. The post gives gas costs (LMS W4 height-10 verification about 205k gas, a LayerZero packet 128,683 gas, worst-case rotation 12.44M gas under the EIP-7825 cap) and cites a NioLabs assessment with no critical or high findings. It is relevant as a worked post-quantum migration design for bridge key custody, including hybrid ECDSA+LMS mode and stateful-signature pitfalls such as leaf reuse and rollback.

ethereum-magicians.orgarticlePublished and added 14 Oct 2026🛡️ Security

Draft ERC from Quantova Inc that has Ethereum bridges accept cross-chain message batches only when a committee signs the Merkle root with RFC 8554 LMS hash-based signatures. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain tag, chain ID, guard address and epoch, and enforces a 60-second delay. It reports gas benchmarks (about 205k per LMS W4 height-10 verify, 12.44M worst-case rotation under EIP-7825), a hybrid LMS+ECDSA migration mode, and a NioLabs assessment with no critical or high findings. It argues that Shor's algorithm makes secp256k1 and BLS committee keys a quantum theft target.

ethereum-magicians.orgpaperPublished and added 14 Oct 2026🛡️ Security

Trail of Bits tested 25 popular package managers with a Docker and mitmproxy harness that simulates a compromised package repository injecting malware into legitimate packages. Fewer than half enforce lockfile hashes by default, only two verified every download, and only Go verifies signatures by default. The post covers lockfile hash pitfalls (Pub, pnpm, Conan, CocoaPods, Composer), repository, developer and Sigstore signing, and Go's checksum database. It also proposes lockfiles that commit to a signing identity plus a transparency log.

blog.trailofbits.comwriteupPublished and added 14 Oct 2026🛡️ Security

Presents the first blind signature in which the issuer runs unmodified NIST-standardized ML-DSA, so it works with certified secure elements. Issuance is an ML-DSA signature on a commitment. The blind signature is a VOLE-in-the-head zero-knowledge proof of knowledge of that signature, about 1 MB, under 1 s to produce and 0.5 s to verify. Security reduces to ML-DSA EUF-CMA and the proof system. Issuer-hiding and selective disclosure add a few tens of KB. The paper also introduces edaBitE, a batch consistency check between binary and prime-field commitments that replaces the costly edaBits checks.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

Presents a modular device-binding protocol for post-quantum anonymous credentials. The phone Secure Element signs a verifier challenge with an unmodified FIPS 204 ML-DSA interface, and the user proves knowledge of that signature in zero knowledge at each presentation. Using ML-DSA's structure avoids the cost of generic NIZK systems such as Longfellow. The most efficient variants assume weak-MLWR for unlinkability, and that assumption can be dropped at some efficiency cost. The protocol works with different anonymous credential schemes, and a proof-of-concept implementation is included. This matters for planned EU age-verification and Google Wallet/mDL rollouts, which need protection against credential sharing.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

CoinDesk summarizes Coinbase's recommendations for making Bitcoin quantum-resistant before a cryptographically relevant quantum computer (CRQC) can derive private keys from public keys. The proposals are: a transaction format that can carry new signature types (P2MR/BIP-360, P2TRv2), staged hybrid "1-of-2" spends with ECDSA/Schnorr or a post-quantum key, and stateless options alongside stateful schemes to avoid key-reuse forgery. They also ask that evaluation favor constant-time, RNG-failure-safe implementations, require MPC compatibility, and handle dormant or late-migrating coins as a separate debate. It is a useful overview of the defensive migration design space, but it is secondary reporting and not the primary Coinbase paper.

coindesk.comarticlePublished and added 14 Oct 2026🛡️ Security

Coinbase's October 2026 position on Bitcoin's post-quantum migration, as reported by The Block. Coinbase, which holds about 5% of bitcoin supply, favors output designs that separate the container from the signature scheme (P2MR/BIP-360, P2TRv2), staged hybrid 1-of-2 spending paths, a stateless option beside stateful signatures, and MPC-compatible schemes for custody. It also wants the abandoned-coins debate run in parallel.

theblock.coarticleAdded 31 Oct 2026, published 14 Oct 2026🛡️ Security

Summarizes Coinbase's blog post on preparing Bitcoin and custody infrastructure for post-quantum threats. It covers public-key exposure (an estimated 6.7–7M BTC behind already-exposed keys), BIP 360 (P2MR) and P2TRv2 outputs, 1-of-2 hybrid classical/post-quantum spending paths, and the state-reuse forgery risk of stateful signatures. It also covers candidate schemes (ML-DSA, SLH-DSA, FN-DSA, SHRINCS), MPC/HSM compatibility and side-channel tests, and separate handling of dormant, lost and exposed legacy funds.

en.cryptonomist.charticlePublished and added 13 Oct 2026🛡️ Security

Overview of FieldWatch, a free open-source Android app that passively listens to Wi-Fi and Bluetooth with the phone's own radios and matches them against an editable catalog of about 250 device signatures (trackers, drones, cameras, body cams, mesh radios). It supports alerts, recorded sessions, path maps, Remote ID drone and pilot location, GNSS interference/spoofing detection and export to TAK/ATAK. The article also covers its limits (no direction finding, no Bluetooth Classic, cellular or full Wi-Fi traffic, pattern matches only) and sideloading from the official GitHub repo on Android 10+.

hackers-arise.comarticlePublished and added 13 Oct 2026🛡️ Security

Introduces leakage-resilient incompressible cryptography, a security model combining leakage resilience (partial key leakage plus full ciphertext) with incompressibility (full key but only part of the ciphertext or signature). It gives a transformation from incompressible symmetric-key encryption (SKE) to leakage-resilient incompressible SKE, a leakage-resilient incompressible PKE built from a new leakage-resilient non-committing KEM, and an incompressible SKE with ciphertext and compression rate 1/2 using invertible extractors. It also gives a leakage-resilient incompressible signature scheme in the random oracle model under DCR or LWE plus Decisional Linear. Black-box impossibility results show barriers to improving these parameters.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🛡️ Security

Ledger's Donjon team confirmed on October 10, 2026 a physical implant inside a hardware wallet sold by Malaysia-based reseller CryptoBilis. The implant reads the device display, decodes the 24-word recovery phrase with a microcontroller, and exfiltrates it over LTE via a provisioned eSIM, leaving the Secure Element, OS, transactions and signatures untouched. Onchain investigator Specter traced over $86 million in suspected thefts across Ethereum, Tron and Bitcoin; Ledger advises CryptoBilis buyers to migrate funds to a new device with a new recovery phrase.

en.cryptonomist.charticlePublished and added 13 Oct 2026🛡️ Security

Ledger's Donjon security team confirmed an unauthorized hardware implant inside Ledger signers sold by Southeast Asian reseller CryptoBilis. The implant sits in the enclosure, reads the 24-word recovery phrase from the screen during setup, decodes it with a microcontroller, and exfiltrates it over LTE via a provisioned eSIM, without touching the Secure Element, OS, or signatures. Onchain investigator Specter traced over $86M in suspected thefts across Ethereum, Tron and Bitcoin; Ledger is reviewing reports of tampered devices elsewhere and advises affected buyers to move funds to a new device with a new seed.

decrypt.coarticlePublished and added 13 Oct 2026🛡️ Security

The paper analyses stateful hash-based signatures whose key is a tree of hash chains, and asks what a second signature from the same one-time key reveals after state loss or rollback. It proves that the values derivable from several signatures are exactly the union of those from each signature alone. It also bounds forgery after b signatures in the classical random-oracle model by a combinatorial coverage exponent λ_b, including when the signer grinds a counter. It then introduces CUTS, a scheme on one binary tree whose chain positions sum to a fixed value S and whose signature size and verification cost do not depend on tree height. One parameter set has 1,424-byte signatures and λ_2 ≥ 128.6. A counter variant, CUTS+C, gives a proven grinding gain.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026🛡️ Security

Decrypt reports that Zakura, which builds a Zcash full node, expects post-quantum signature opcodes in Zcash in January, to enable hash-based signatures for transparent pools. The plan rotates to a fresh transparent address after every transaction so public keys stay hidden, and adds a WOTS hash-based backup signature. Private information retrieval, shipping this week in the Vizor wallet, stops servers from linking the rotated addresses. It follows Justin Drake's "bunker mode" warning that AI-driven math could break ECDSA. The plan covers only transparent payments, and no activation date has been confirmed.

decrypt.coarticlePublished and added 11 Oct 2026🛡️ Security

Position paper arguing that as AI makes machine-checked proofs cheap, the scarce resource is a human who can read what was proved. It cites a Lean library's Schnorr signature security theorem that passed the checker but held for every adversary and so promised nothing. It shows that on a one-page Verifpal model, two of five verdicts flip under other standard definitions of properties such as forward secrecy. It proposes short, owner-written high-level cryptographic languages, with every claim backed by a checked theorem and a small, versioned, publicly agreed set of built-in security definitions.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026🛡️ Security