cryptocafe

Crypto Café at FAU Department of Mathematics and Statistics

Our regular Crypto Café seminars take place every other Tuesday,10 am-10:50 am during the semester. We invite local and international experts on topics in Mathematics and Computer Science related to Cryptography and Information Security.

Come and join us for freshly brewed coffee and interesting conversations on the most exciting topics in cryptography.

Where: SE-43 (Charles E. Schmidt College of Science) - Room 215 

https://researchseminars.org/seminar/CryptoCafe


You can catch up on any missed meetings by following the link below:

Upcoming Presentations

Spring 2026, Crypto Cafe Schedule:

TBA

Recent Presentations

February 17, 2026, 10:00 am  Science Building (SE-43), room 271

Speaker:  Luke Carey, Ph.D. student, Department of Mathematics and Statistics, Florids Atlantic University

Title:  An Overview of DualMS: A Post-Quantum Multi-Signature

Abstract:  A multi-signature is a cryptographic scheme which allows for multiple independent parties to sign a singular message together. The scheme DualMS by Yanbo Chen (2023) is an example of a post-quantum lattice-based two-round multi-signature scheme, which utilizes many fascinating cryptographic techniques, including Module Learning with Errors (MLWE), rejection sampling, and the discrete Gaussian. At this talk, we will give an overview of DualMS, give a very short outline of the proof of security, and briefly discuss possible future directions we can take DualMS.

Video Recording

https://researchseminars.org/seminar/CryptoCafe

February 3, 2026, 10:00 am  Science Building (SE-43), room 271

Speaker:  Bardia Taghavi, Ph.D. student, Computer Engineering, Florida Atlantic University

Title:  Two Birds, One Stone: A Unified High-Performance NTT Architecture for ML-KEM and ML-DSA

Abstract:  With the recent NIST standardization of ML-KEM (Kyber) and ML-DSA (Dilithium), the focus of Post-Quantum Cryptography (PQC) research has shifted from algorithm selection to efficient hardware implementation. While both schemes rely on the hardness of the module-lattice hardness assumptions and utilize the Number Theoretic Transform (NTT) for fast polynomial multiplication, they operate over distinct algebraic rings (Rq with q=3329 for Kyber vs. q=8,380,417 for Dilithium). This discrepancy typically forces hardware designers to implement separate, redundant accelerators for each scheme, leading to suboptimal area efficiency.

In this talk, I will present a novel, high-performance unified NTT architecture capable of accelerating both ML-KEM and ML-DSA within a single, reconfigurable hardware block. We will examine the mathematical structures that allow for a "dual-mode" Butterfly Unit (BFU) design, utilizing configurable modular reduction techniques (such as Barrett reduction or Montgomery multiplication) that adapt to either modulus at runtime.

Video Recording

https://researchseminars.org/seminar/CryptoCafe