Syllabus
This hands-on training focuses on unpacking the core principles behind two upcoming post-quantum cryptographic NIST standards: ML-KEM and ML-DSA. While these schemes may appear complex at first glance, we strongly believe that their foundations can be made accessible through clear explanations and hands-on exploration. The course is predominantly made up of guided practical sessions on machine, giving participants direct experience with the structure, logic, and implementation of these new cryptographic mechanisms. Understanding these schemes is increasingly critical, as they are set to be integrated into many of our systems in the near future — becoming essential components of future secure digital infrastructures.
After this training, a participant should be able to:
- understand the core ideas behind ML-KEM and ML-DSA;
- use them in relevant contexts;
- locate the critical steps that can create weaknesses.
This training can follow the introductory training on post quantum cryptography.
Language
The training is provided in French by default but it is possible to open sessions in English. Let us know if you are interested.
Duration and location
1 day in our office in Paris or directly on-site.
Pre-requisites
Participants should be relatively comfortable with Python and know basic linear algebra. Participants are expected to bring a laptop, it is better if Python or Jupyter Notebook is already pre-installed (although online editors can also be used).
Price
1200 € excl. VAT (lunch, coffee and snacks included)
Next sessions in CRX
Our public sessions are organized as a four-day training track. Participants may attend the full track or only selected days. The complete program includes:
- Day 1: Introduction to post-quantum cryptography
- Day 2: Hands-on with ML-KEM and ML-DSA
- Day 3: Hands-on with SLH-DSA, FN-DSA and HQC
- Day 4: Hybridization and practical migration
The next complete training track will open in 2027. To participate or request a tailored on-site session, contact us at training@cryptoexperts.com.