Can Noir/ProveKit verify an EMV tap without leaking PAN, expiry, or CVV? This repo tries.
trending22
01 02 Multiplying Not-So-Big Integers with FFTs: Finding and Pushing the Crossover on Large Modern OoO ARM CPUs eprint.iacr.orgFFT multiplication finally wins earlier on ARM, with tighter Barrett bounds and an OpenSSL RSA speedup to prove it.03 Yet another PQC 101, with NIST’s finalized standards and migration checklist tacked on.04 RSA refresher for adults: keygen, factoring attacks, 896/260-bit wins, and why 2048-bit still isn’t weekend work.05 IM BLOG: Beyond the Dial Tone: Navigating the ASD’s 2030 Cryptography Rules in an Unstable Network Era rimpa.com.auAustralia's ASD PQC transition blog, with the 2026 planning milestone, RSA/ECC sunset talk, and inventory-the-crypto mess advice.06 Two batch-decryption schemes, RSA under strong RSA and IBE under CDH, because apparently public decryption needed a fresh paper.07 Affine-Padding Rabin-Oracle Factoring in $L_n\!\left(\frac{1}{3},\sqrt[3]{\frac{32}{9}}\right)$ eprint.iacr.orgHash padding survives; affine-padded Rabin oracles still fall to an NFS-style factorization in L_n(1/3, ∛32/9).08 New RSA forgery attack skips factoring, so the old "just use bigger moduli" advice ages about as well as milk.09 Looking for the repo behind the SNFS-speed RSA forgery paper, with CADO-NFS code and attack details?10 Slashdot on a new forgery attack against textbook and blind-signature RSA, not the padded kind we still ship, naturally.11 HBGs get the usual three-pronged upgrade: LWE with succinct CRS, pairings with batch openings, RSA with both.12 Still using raw RSA signatures? This details a 1024-bit forgery that cost 1380 core-years and, annoyingly, no key recovery.13 RSA, repurposed for succinct batch threshold encryption, aggregate signatures, and broadcast encryption via PPRGs.14 Can Claude actually help break RSA-896, or just babysit CADO-NFS GPU ports and publicize the factorization?15 Quantum Computers Will Never Break RSA, Says Oxford Physicist. But I Say Migrate Anyway profwoodward.substack.comOxford physicist claims QC has a hard ceiling below RSA-breaking scale, and the author still says to migrate anyway.16 RSA didn't die by factoring this time, just by a new forgery attack that turns 1024-bit keys into museum pieces.17 Unravelled linearization trims CRT-RSA small-exponent attacks to half the lattice size of Takayasu-Lu-Peng, same punch.18 How did they forge 1,024-bit RSA signatures without factoring n? By pushing a weird NFS variant to the edge, apparently.19 RSA-896 was factored with Claude-assisted CADO-NFS porting, because 896-bit RSA was already on life support.20 Fits a trendline to RSA crack dates and predicts the next milestone, assuming factoring keeps behaving like a spreadsheet.21 ePrint preprint on Joux-Naccache-Thomé, forges 1024-bit RSA with a signing oracle and no factoring.22 RSA-896 finally falls, with p and q published, so the benchmark modulus is no longer just a benchmark.