#cryptography is an active hashtag on Bluesky. In the last 30 days, 66 people shared 281 posts with it — around 9 a day. Activity is up 126% versus the previous week, peaking on Jul 30 with 40 posts.
Tags most often used together with #cryptography.
gist.github.com
Scripts to Remove Space Based Steganography
Scripts to Remove Space Based Steganography. GitHub Gist: instantly share code, notes, and snippets.
soatok.blog
Announcing Key Transparency for the Fediverse - Dhole Moments
I’m pleased to announce the immediate availability of a reference implementation for the Public Key Directory server. This software implements the Key Transparency specification I’ve be…
eprint.iacr.org
A Polynomial-Time Quantum Algorithm for the Dihedral Coset Problem
We present a polynomial-time quantum algorithm for the Dihedral Coset Problem (DCP). The algorithm is based on Regev's polynomial-time reduction of the Dihedral Subgroup Problem (DSP) to the modular subset sum problem, but uses a different technique to erase sample bits without use of a subset sum oracle. The algorithm can thus combine with Regev's reduction of lattice problems to DCP, improved by Brakerski, Kirshanova, Stehl{\'e} and Wen, to yield polynomial-time quantum algorithms for various lattice problems, such as finding a polynomial-factor approximation to the shortest vector in an $n$-dimensional lattice (SVP), and the ``learning with errors'' problem (LWE). The algorithm can tolerate a faulty sample rate as high as $1/O(\log{n})$, allowing the algorithm-reduction combination to efficiently solve, for example, SVP with a $\sqrt{n}$ polylog($n$) approximation factor, or LWE instances with $\alpha=\sqrt{n}$ polylog($n$).
blog.trailofbits.com
The cryptography behind passkeys
This post will examine the cryptography behind passkeys, the guarantees they do or do not give, and interesting cryptographic things you can do with them, such as generating cryptographic keys and…
iacr.org
IACR Fellows
cyberupdates365.com
What Are Mathematical Attacks in Cyber Security? (2026 Guide)
Learn what are mathematical attacks in cyber security. See how hackers break encryption and how to secure your network today.
infosec.exchange
Original post on infosec.exchange
eprint.iacr.org
A Polynomial-Time Quantum Algorithm for the Dihedral Coset Problem
eprint.iacr.org
A Polynomial-Time Quantum Algorithm for the Dihedral Coset Problem
We present a polynomial-time quantum algorithm for the Dihedral Coset Problem (DCP). The algorithm is based on Regev's polynomial-time reduction of the Dihedral Subgroup Problem (DSP) to the modular subset sum problem, but uses a different technique to erase sample bits without use of a subset sum oracle. The algorithm can thus combine with Regev's reduction of lattice problems to DCP, improved by Brakerski, Kirshanova, Stehl{\'e} and Wen, to yield polynomial-time quantum algorithms for various lattice problems, such as finding a polynomial-factor approximation to the shortest vector in an $n$-dimensional lattice (SVP), and the ``learning with errors'' problem (LWE). The algorithm can tolerate a faulty sample rate as high as $1/O(\log{n})$, allowing the algorithm-reduction combination to efficiently solve, for example, SVP with a $\sqrt{n}$ polylog($n$) approximation factor, or LWE instances with $\alpha=\sqrt{n}$ polylog($n$).
ieeemilestones.ethw.org
Milestone-Proposal:Colossus
papoo.work
Anthropic’s cryptanalysis win is a real signal, but not all “AI found an attack” headlines are equal
papoo.work
Anthropic’s Claude Mythos Just Found a Real Crack in Cryptography
papoo.work
Anthropic’s cryptanalysis win is a real signal, but not all “AI found an attack” headlines are equal
Posts are pulled live from Bluesky and cached briefly. Posts with content labels are hidden.
