Mikhail Kudinov's Avatar

Mikhail Kudinov

@error024.bsky.social

PhD, Post-Quantum cryptography. https://error0024.github.io/

74 Followers  |  103 Following  |  27 Posts  |  Joined: 29.11.2024  |  2.0095

Latest posts by error024.bsky.social on Bluesky

Post image

πŸŽ“ After 4 years, 7 papers, countless joyful moments, and meeting so many great people along the way, I’m excited to share that I’ve officially obtained my PhD!

It’s been an incredible journey of learning, persistence, and growth.

My thesis is now available here:
πŸ”— pure.tue.nl/ws/portalfil...

28.10.2025 10:16 β€” πŸ‘ 5    πŸ” 1    πŸ’¬ 0    πŸ“Œ 0

Delete twitter from the phone. So you only get there from you computer (if you even need that)

09.10.2025 12:21 β€” πŸ‘ 0    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0

We are alarmed by reports that Germany is on the verge of a catastrophic about-face, reversing its longstanding and principled opposition to the EU’s Chat Control proposal which, if passed, could spell the end of the right to privacy in Europe. signal.org/blog/pdfs/ge...

03.10.2025 16:14 β€” πŸ‘ 3998    πŸ” 2433    πŸ’¬ 41    πŸ“Œ 147

I’m flagging this nice book/paper on FHE schemes not necessarily because it’s correct and I endorse it, but because it looks pretty useful. arxiv.org/pdf/2503.05136

22.09.2025 19:21 β€” πŸ‘ 27    πŸ” 4    πŸ’¬ 1    πŸ“Œ 0
Post image

CryptoCorgi

20.09.2025 20:22 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0

Some can always find a way to communicate and get uncensored information. But the goal is to disconnect the general audience from accessing independent news. It is important to fight censorship not for your own access, but for those who won’t fight.

18.09.2025 18:09 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0

I get mine from news.zksecurity.com :)
And zkmesh.substack.com

15.09.2025 08:26 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
EU Chat Control criticized by 500 cryptographers over privacy risks

EU Chat Control criticized by 500 cryptographers over privacy risks

Over 500 cryptographers warn the EU draft β€œChatβ€―Control” could weaken end‑to‑end encryption. The EU council votes on the Danish text on Sepβ€―12,β€―2025. https://getnews.me/eu-chat-control-criticized-by-500-cryptographers-over-privacy-risks/ #euchatcontrol #privacy #cryptography

09.09.2025 11:37 β€” πŸ‘ 3    πŸ” 3    πŸ’¬ 0    πŸ“Œ 0

Will there be a recording?

25.08.2025 17:27 β€” πŸ‘ 0    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0

That is wild! I am envious of your students; that is top-level material!

06.08.2025 18:19 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0

I'm thrilled to announce that after months of intensive work, the complete materials for my Applied Cryptography course at the American University of Beirut are now finished: both Part 1 (Provable Security) and Part 2 (Real-World Cryptography)!

06.08.2025 08:01 β€” πŸ‘ 31    πŸ” 9    πŸ’¬ 4    πŸ“Œ 1
Nadim Kobeissi's Applied Cryptography Course
YouTube video by Nadim Kobeissi Nadim Kobeissi's Applied Cryptography Course

I made a video about my upcoming applied cryptography course: youtu.be/z6kK7rIbyB0

28.07.2025 08:51 β€” πŸ‘ 23    πŸ” 3    πŸ’¬ 3    πŸ“Œ 0
Post image 26.07.2025 20:56 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Post image

Crypto 2025 is just around the corner! Check out the full program here:
crypto.iacr.org/2025/program...

Join us on Monday for our talk where we explore the tradeoffs of hash-based signatures.

We then apply these findings to propose post-quantum Ethereum PoS signatures:
eprint.iacr.org/2025/1332

25.07.2025 18:00 β€” πŸ‘ 4    πŸ” 1    πŸ’¬ 0    πŸ“Œ 0
Abstract. In this note, we present a new instantiation of the hash-based multi-signature framework introduced by Drake, Khovratovich, Kudinov, and Wagner (CiC Vol 2 Issue 1, eprint 2025/055) for Ethereum’s consensus layer. Inspired by a recent work of Khovratovich, Kudinov, and Wagner (Crypto 2025, eprint 2025/889), we instantiate the framework with a novel incomparable encoding that improves the tradeoff between signature size and verification hashing. The purpose of this document is to make explicit how to use the ideas of the latter work within the framework of Drake, Khovratovich, Kudinov, and Wagner.

Abstract. In this note, we present a new instantiation of the hash-based multi-signature framework introduced by Drake, Khovratovich, Kudinov, and Wagner (CiC Vol 2 Issue 1, eprint 2025/055) for Ethereum’s consensus layer. Inspired by a recent work of Khovratovich, Kudinov, and Wagner (Crypto 2025, eprint 2025/889), we instantiate the framework with a novel incomparable encoding that improves the tradeoff between signature size and verification hashing. The purpose of this document is to make explicit how to use the ideas of the latter work within the framework of Drake, Khovratovich, Kudinov, and Wagner.

Technical Note: LeanSig for Post-Quantum Ethereum (Justin Drake, Dmitry Khovratovich, Mikhail Kudinov, Benedikt Wagner) ia.cr/2025/1332

22.07.2025 22:05 β€” πŸ‘ 2    πŸ” 1    πŸ’¬ 0    πŸ“Œ 0

I am rereading the comics. These are great an so many new ones came out :)

13.07.2025 07:28 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Preview
The EU wants to decrypt your private data by 2030 The EU Commission unveiled the first step in its security strategy to ensure "lawful and effective" law enforcement access to data

This battle will keep playing out over and over again until they achieve something that their own citizens have made it clear they don’t want. www.techradar.com/vpn/vpn-priv...

05.07.2025 17:39 β€” πŸ‘ 95    πŸ” 43    πŸ’¬ 3    πŸ“Œ 6

You never asked πŸ˜…

29.06.2025 17:32 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
I'm DONE withΒ Google
YouTube video by PewDiePie I'm DONE withΒ Google

PewDiePie’s evolution into a tech geek is so cool! His recent video dives deep into privacy concerns and surveillance issues, while being still fun to watch. I think these are the topics that couldn’t be more relevant today. Highly recommend watching his take on it:

πŸ”— youtu.be/u_Lxkt50xOg?...

29.06.2025 08:50 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0

Single author, fifteen pages, reduces the bit complexity of millenia-old UOV instances!!

19.06.2025 12:39 β€” πŸ‘ 13    πŸ” 3    πŸ’¬ 1    πŸ“Œ 0

A touchpad is also acceptable, but if you are using a mouse, why would you use Apple’s? :)

19.06.2025 17:32 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Prepare your network for quantum-secure encryption in TLS - Apple Support Learn about quantum-secure encryption in TLS and how to check if your organization's web servers are ready.

Apple announces that TLS client connections in version 26+ will be using hybrid PQ X25519MLKEM768 by default

support.apple.com/en-us/122756

09.06.2025 22:34 β€” πŸ‘ 46    πŸ” 15    πŸ’¬ 3    πŸ“Œ 1

A nice 127 pages read πŸ₯²

23.05.2025 11:37 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Abstract. Hash-based signatures have been studied for decades and have recently gained renewed attention due to their post-quantum security. At the core of the most prominent hash-based signature schemes, XMSS and SPHINCS+, lies a one-time signature scheme based on hash chains due to Winternitz. In this scheme, messages are encoded into vectors of positions (i.e., vertices in a hypercube) in the hash chains, and the signature contains the respective chain elements. The encoding process is crucial for the efficiency and security of this construction. In particular, it determines a tradeoff between signature size and computational costs. Researchers have been trying to improve this size-time tradeoff curve for decades, but all improvements have been arguably marginal.

In this work, we revisit the encoding process with the goal of minimizing verification costs and signature sizes. As our first result, we present a novel lower bound for the verification cost given a fixed signature size. Our lower bound is the first to directly apply to general encodings including randomized, non-uniform, and non-injective ones.

Then, we present new encodings and prove their security. Inspired by our lower bound, these encodings follow a counterintuitive approach: we map messages non-uniformly into the top layers of a much bigger hypercube than needed but the encoding itself has (hard to find) collisions. With this, we get a 20 % to 40 % improvement in the verification cost of the signature while keeping the same security level and the same size. Our constructions can be directly plugged into any signature scheme based on hash chains, which includes SPHINCS+ and XMSS.

Abstract. Hash-based signatures have been studied for decades and have recently gained renewed attention due to their post-quantum security. At the core of the most prominent hash-based signature schemes, XMSS and SPHINCS+, lies a one-time signature scheme based on hash chains due to Winternitz. In this scheme, messages are encoded into vectors of positions (i.e., vertices in a hypercube) in the hash chains, and the signature contains the respective chain elements. The encoding process is crucial for the efficiency and security of this construction. In particular, it determines a tradeoff between signature size and computational costs. Researchers have been trying to improve this size-time tradeoff curve for decades, but all improvements have been arguably marginal. In this work, we revisit the encoding process with the goal of minimizing verification costs and signature sizes. As our first result, we present a novel lower bound for the verification cost given a fixed signature size. Our lower bound is the first to directly apply to general encodings including randomized, non-uniform, and non-injective ones. Then, we present new encodings and prove their security. Inspired by our lower bound, these encodings follow a counterintuitive approach: we map messages non-uniformly into the top layers of a much bigger hypercube than needed but the encoding itself has (hard to find) collisions. With this, we get a 20 % to 40 % improvement in the verification cost of the signature while keeping the same security level and the same size. Our constructions can be directly plugged into any signature scheme based on hash chains, which includes SPHINCS+ and XMSS.

Image showing part 2 of abstract.

Image showing part 2 of abstract.

At the Top of the Hypercube – Better Size-Time Tradeoffs for Hash-Based Signatures (Dmitry Khovratovich, Mikhail Kudinov, Benedikt Wagner) ia.cr/2025/889

19.05.2025 10:27 β€” πŸ‘ 5    πŸ” 2    πŸ’¬ 0    πŸ“Œ 1

Will there be a recording?

17.05.2025 14:44 β€” πŸ‘ 1    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0
Preview
Hacking Cryptography Learn how the good guys implement cryptography and how the bad guys exploit it.</b> Everything we do in the digital world is protected by cryptography. But when pure math and algorithms are implement...

Great initiative!

Saw some references for Go. Can I suggest a recent one: www.manning.com/books/hackin...

12.05.2025 11:31 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0

Excited to be heading to #Eurocrypt2025 in Madrid soon!

I’ll be speaking at Algebraic Hash Cryptanalysis Days on Security Requirements in the Context of Hash-Based Signatures.

Catch me at the affiliated events or during the main conference. Let’s connect! #Cryptography #Madrid

29.04.2025 07:59 β€” πŸ‘ 5    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Treating Dishonest Ciphertexts in Post Quantum KEMs – Explicit vs  Implicit Rejection in the FO T
YouTube video by PQCrypto conference videos Treating Dishonest Ciphertexts in Post Quantum KEMs – Explicit vs Implicit Rejection in the FO T

🎀 My talk from #PQCrypto2025 is now live on YouTube!

I discussed rejection types in KEMs. Why they matter, how they impact security and which one should you choose.

Check it out & let me know your thoughts! πŸ‘‡
πŸ“Ί youtu.be/W-gUd_qTUs4?...

#PostQuantum #Cryptography #KEMs

27.04.2025 23:26 β€” πŸ‘ 4    πŸ” 3    πŸ’¬ 0    πŸ“Œ 0

Did they discuss the applications?

25.04.2025 08:49 β€” πŸ‘ 0    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0

@error024 is following 20 prominent accounts