This thesis topic aims to have a student study the most recent major Long-Term Support (LTS) version of Java, specifically Java 25, and to provide a comprehensive seminar on cryptography primitives and security based on their research. The following sections will be included: slides, seminar exercises, and a homework/midterm assignment.

The seminar should provide an overview and compilation of hands-on tasks on the use of cryptographic primitives, including post-quantum cryptography (PQC) schemes, especially certified ones such as ML-KEM and ML-DSA. Most of the exercises will use the Bouncy Castle library. A small part of the seminar is about Java providers; there will be a corresponding demo in the exercises. Some of the tasks students will be asked to complete will consist of generating random values, using a (keyed) hash function, encrypting data using symmetric and asymmetric encryption, key derivation, creating a signature, and matching signatures to public keys with different algorithms.

The slides will include a presentation to introduce students to the topic, with correct solutions to the exercises that follow. The homework/midterm should test students beyond the seminar tasks, combining and embedding the skills gained during the seminar.