Évènement

Abstract : This presentation explores how the security of cryptographic algorithms is formally proven. Historically, security relied on the absence of known attacks, but since the 1980s–90s, the focus shifted to mathematical proofs. The core idea is to show that breaking a scheme’s security is at least as hard as solving a well-known hard mathematical problem (e.g., integer factorization or discrete logarithm). Today, the most widely used method is game-based security proof, where security is modeled as a game between an adversary and a challenger. This talk will explain this method and demonstrate how different security guarantees can be established through such games.