Create accountLogin

Recent searches

No recent searches

Search options

Only available when logged in.
eupolicy.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
This Mastodon server is a friendly and respectful discussion space for people working in areas related to EU policy. When you request to create an account, please tell us something about you.

Administered by:

Server stats:

213
active users

eupolicy.social: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.8

#cryptography

0 posts0 participants0 posts today
Public
gtbarry

See How Much Faster a Quantum Computer Will Crack Encryption

“quantum bits,” or qubits, transcend binaries. They can exist as a 1 or a 0 or something else entirely. That flexibility allows future quantum computers to quickly solve certain types of problems—like cracking cryptographic codes—that traditional computers simply can’t

#quantum #quantumcomputing #encryption #cryptography #security #cybersecurity #hackers #hacking #technology #tech #science #innovation

wired.com/story/youre-not-read

WIRED · You're Not Ready for Quantum CracksBy Brian Barrett
Public
Cryspen

At IEEE S&P in May 2025, Théophile Wallez presented new results on the formal security verification of a bit-precise executable specification of TreeKEM, the core key agreement component of the Messaging Layer Security protocol. This work was done in collaboration with Karthikeyan Bhargavan, our chief research scientist and one of Théophile's PhD supervisors.

eprint.iacr.org/2025/410

IACR logo
IACR Cryptology ePrint Archive · TreeKEM: A Modular Machine-Checked Symbolic Security Analysis of Group Key Agreement in Messaging Layer SecurityThe Messaging Layer Security (MLS) protocol standard proposes a novel tree-based protocol that enables efficient end-to-end encrypted messaging over large groups with thousands of members. Its functionality can be divided into three components: TreeSync for authenticating and synchronizing group state, TreeKEM for the core group key agreement, and TreeDEM for group message encryption. While previous works have analyzed the security of abstract models of TreeKEM, they do not account for the precise low-level details of the protocol standard. This work presents the first machine-checked security proof for TreeKEM. Our proof is in the symbolic Dolev-Yao model and applies to a bit-level precise, executable, interoperable specification of the protocol. Furthermore, our security theorem for TreeKEM composes naturally with a previous result for TreeSync to provide a strong modular security guarantee for the published MLS standard.
#MLS#Cryptography
Public
Rob Carlson :ally: :BLM:

Got to the good part of my nighttime reading: Substitution-Permutation Networks. This book is great because the equations, examples and diagrams all support each other in a way that I just keep flipping between the three for each concept until I understand the sum of the parts. #cryptography

A partially open book illuminated by soft light displays a diagram of a substitution-permutation network, featuring interconnected elements labeled with letters. The page includes text discussing linear cryptanalysis. A hand is visible, holding the book.
Public
Flippin' 'eck, Tucker!

Somewhat concerning for anyone who uses Proton Mail: there is a flaw in the OpenPGP javascript library that they use (and are the maintainers for) which means that it's possible for spoofed authentication signatures to be created.

theregister.com/2025/05/20/ope

The Register · Freshly discovered bug in OpenPGP.js undermines whole point of encrypted commsBy Connor Jones
#OpenPGP#Encryption#Security
Public
The New Oil

The #NSA’s “Fifty Years of Mathematical #Cryptanalysis (1937–1987)”

schneier.com/blog/archives/202

Schneier on Security · The NSA's "Fifty Years of Mathematical Cryptanalysis (1937–1987)" - Schneier on SecurityIn response to a FOIA request, the NSA released “Fifty Years of Mathematical Cryptanalysis (1937-1987),” by Glenn F. Stahly, with a lot of redactions. Weirdly, this is the second time the NSA has declassified the document. John Young got a copy in 2019. This one has a few less redactions. And nothing that was provided in 2019 was redacted here. If you find anything interesting in the document, please tell us about it in the comments.
#cybersecurity#cryptography
ExploreLive feeds
About