Search: “cryptography”

11 stories in the last 30d

Searchkeyword smart Sortlatest hot importance relevance

DomainAll Cyber AIWindow24h 3d 7d 30d AllIn the wild Important only Show duplicates

CategoryAll Research 11 Industry 8 Policy & legal 8 Tools 6 Threat actor 5 Advisory 4 AI safety & security 3 Exploit / PoC 2 Data breach 2 AI research 2 Vulnerability 1

SeverityAll critical 2 high 3 medium 10 low 0 info 37

Getting ahead of ‘harvest-now-decrypt-later’: Post-quantum cryptography planning

Opinion piece urges organizations to begin post-quantum cryptography migration now, citing harvest-now-decrypt-later risk and NIST deadlines.

CSO Online outlines why harvest-now-decrypt-later makes long-lived sensitive data a current risk even before quantum computers exist. It cites NIST IR 8547 timelines deprecating RSA-2048 and ECC P-256 by 2030 and removing them by 2035, finalized FIPS standards ML-KEM, ML-DSA, and SLH-DSA, upcoming FN-DSA (FIPS 206), NSA requirements for national security systems from 2027, and UK NCSC phased guidance through 2035. The author recommends cryptographic discovery, crypto-agility, and prioritizing long-confidentiality data and TLS endpoints.

CSO OnlineSep 10, 09:00 UTC · 7d agoResearch

A Global Readiness and Sovereignty Capability Model for Post-Quantum Cryptography Migration

Researchers propose a Readiness-Sovereignty Capability Model scoring 57 countries on post-quantum cryptography readiness and sovereignty.

The RSCM model decomposes cryptographic sovereignty into indigenous capacity, indigenous post-quantum control, and external dependency, with a gate requiring demonstrated creation in at least one core layer. Applied to 57 documented cryptographic actors, 20 countries clear the maker gate (15 full-stack, 5 research makers), 11 hold strong general capacity without post-quantum control, and 25 are dependent. Readiness correlates with independent cyber indices up to rank correlation 0.70, while post-quantum creation shows no significant correlation with commitment (0.22).

arXiv cs.CRSep 16, 11:10 UTC · 22h agoResearch

Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0 (1999)

Seminal 1999 USENIX study finds most novice users cannot correctly sign and encrypt email with PGP 5.0 in 90 minutes.

Whitten and Tygar's USENIX Security Symposium paper evaluates whether cryptography novices can use PGP 5.0 effectively, using cognitive walkthrough analysis and a laboratory user test. The majority of test participants failed to successfully sign and encrypt a message within 90 minutes, despite PGP 5.0 having a well-regarded graphical interface. The authors argue that security requires usability standards beyond those of general consumer software and propose domain-specific UI design principles for security. The paper is a foundational reference in usable security research.

Lobsters · securitySep 9, 06:47 UTC · 8d agoResearch

EFI Pairs Without One-Way Puzzles: Oracle Separations from Communication Complexity

Theorists build a classical oracle where one-way puzzles fail yet EFI pairs survive, separating two candidate minimal assumptions of quantum cryptography.

The paper constructs a single classical oracle relative to which one-way puzzles do not exist, even with an unbounded verifier, while an EFI pair survives every classical-query distinguisher holding advice, making one superposition query at the end. Security is proven by reducing adversary knowledge to communication complexity for Vector-in-Subspace, with the superposition query bounded using random matrix theory. Relative to the oracle, quantum polynomial time offers no advantage on tasks with classical inputs and outputs and there is no proof of quantumness, separating the leading minimal assumptions of quantum cryptography.

arXiv cs.CRSep 10, 17:54 UTC · 6d agoResearch

Zombie Card Attack Can Revive Expired Visa Cards for Contactless Payments

UMass Amherst researchers demonstrate Zombie Card, an NFC relay attack that revives expired Visa contactless cards for in-store purchases without breaking cryptography.

Researchers at the University of Massachusetts Amherst presented the Zombie Card attack at USENIX Security 2026, showing that Visa's Kernel 3 does not cryptographically bind the Application Expiration Date (tag 5F24) the terminal reads with the Track 2 expiry seen by the issuer. By positioning an NFC man-in-the-middle relay, an attacker can rewrite the terminal-facing expiration date of an expired card and complete contactless purchases, provided the account remains open under the same PAN and the bank does not independently re-check expiry. Testing across five major US banks found three distinct policies; Visa Kernel 3 accepted the modified date, while Mastercard, American Express, and Discover kernels declined modified transactions. Findings were disclosed to Visa and affected banks in May 2025, no CVE has been assigned, and no exploitation has been reported.

The Hacker NewsAug 20, 18:30 UTC · 27d agoResearch

Automatic Key Exchange: faster, post-quantum secure origin handshakes for 45 billion daily connections (and counting)

Cloudflare's Automatic Key Exchange probes origins to lead with preferred key exchange, cutting HelloRetryRequests from 52% to 3.7% and enabling automatic post-quantum origin connections.

Cloudflare announced Automatic Key Exchange, an extension of Automatic SSL/TLS that probes each origin's supported key agreement algorithms and leads with the preferred one, favoring the post-quantum hybrid X25519MLKEM768. Rollover across roughly 45 billion daily origin connections cut HelloRetryRequests from about 52% to 3.7%, saving more than 150 ms of p90 handshake latency. Hundreds of thousands of domains now receive post-quantum origin connections without manual configuration, supporting Cloudflare's goal of quantum-safe encryption by 2029 to counter harvest-now-decrypt-later attacks.

Cloudflare BlogSep 8, 13:10 UTC · 8d agoResearch

I've factored the RSA keys of a Certificate Authority from the 90s

Security researcher factored two 512-bit RSA root CA keys from defunct 1990s certificate authority E-Certify using CADO-NFS on a desktop in roughly 30 hours each.

A researcher extracted legacy root certificates from archived Netscape and Internet Explorer installers, identifying two 512-bit RSA roots shipped with Netscape 4.51 in 1999 by the defunct Canadian CA E-Certify. Using CADO-NFS on a Ryzen 9 5950X desktop, the keys were factored in 32 and 29 hours respectively, allowing private key reconstruction. The work comes shortly after RSA-260 (862-bit) was factored, the largest known factorization to date. The researcher also built a legacy TLS server and published keys and tools on GitHub.

Hacker News · securitySep 8, 01:16 UTC · 9d agoResearch HN 411↑ · 86 comments

Proximity Gaps for Gabidulin Codes and Applications

Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.

The paper proves every linear rank-metric code admits a proximity gap for deltas up to (d-1)/(3n) with error at most q^(e+1)/q^m, and improves the gap to (d-1)/(2n) for Gabidulin codes with error at most 10q^(n-1)/q^m, matching bounds for Reed-Solomon codes. A constructed infinite family of constant-rate Gabidulin codes shows the (d-1)/(2n) bound is tight, and a counterexample establishes a lower bound on the error at the d/(3n) gap. Applications include an IOPP for interleaved Gabidulin codes adapted from the Ligero IOPP and a q-linearized polynomial commitment scheme adapted from Ligero-based PCS, reportedly the first PCS framework based on rank-metric codes.

arXiv cs.CRSep 9, 07:45 UTC · 8d agoResearch

When Topology Betrays Privacy: Lattice-Based Reconstruction Attacks on Secure Aggregation in Decentralized Federated Learning

Researchers show colluding nodes in decentralized federated learning can reconstruct private updates despite secure aggregation, using lattice-based attacks tied to the Hidden Subset Sum Problem.

Secure aggregation in decentralized federated learning is widely assumed to hide individual model updates. The authors show that sparse decentralized topologies give colluding semi-honest nodes asymmetric aggregate views exposing hidden linear combinations of honest participants' private states. They establish a formal connection to the Hidden Subset Sum Problem and design a lattice-based reconstruction approach combining lattice reduction with structural filtering. Evaluations on image, tabular, and text tasks show attackers recover local updates and can reconstruct private training data.

arXiv cs.CRSep 8, 09:20 UTC · 9d agoResearch

AD Rights Management Service (Part 1): Architecture, Deprecation, and Reconnaissance

Huntress maps AD RMS architecture and recon paths, setting up an offline key-extraction attack against its unrotatable 255-year root key.

Huntress's multi-part research examines Active Directory Rights Management Services, Microsoft's enterprise DRM role that still ships in Windows Server 2025 despite migration guidance favoring Azure Information Protection. Part 1 covers the trust model and how an ordinary domain account can locate RMS clusters and read rights-policy templates. Part 2 will detail four independent paths for extracting the Server Licensor Certificate (SLC) private key via service-group membership and the configuration database, enabling fully offline decryption of protected documents. The SLC certificate is valid from 2002 to 2258 and has no key-rotation mechanism, so a stolen key decrypts protected content indefinitely.

HuntressSep 8, 04:00 UTC · 9d agoResearch1

Risky Bulletin: Expired cards can be used for new transactions

Researchers show expired Visa contactless cards can be revived via NFC man-in-the-middle relay to run fraudulent transactions; roundup also covers major breaches.

University of Massachusetts Amherst researchers built an NFC man-in-the-middle rig that updates a card's expiration date in transit and relays the modified payment to POS terminals, reviving expired contactless cards; Visa terminals and the backends of all five banks studied failed to catch the manipulation. The same roundup reports Iranian hackers shut down a small UK power plant for four days, Lazarus breached South Korea's Presidential Office as part of a campaign exceeding 100 victims, and French telecom SFR suffered a breach affecting over 2.1 million customers.

Risky Business NewsAug 24, 04:40 UTC · 24d agoResearch1