Lecture

Cryptographic Primitives: Theory and Practice

Description

This lecture covers the fundamental cryptographic primitives including finite fields, Zn rings, Zp fields, Chinese Remainder Theorem, random variables, expected value, variance, arithmetic with big numbers, modular arithmetic, algorithms, birthday effect, generic attacks, easy problems, membership problem, hard problems, non-polynomial algorithms, Turing reduction, symmetric encryption, security models, chosen ciphertext security, adaptive security, decryption security, and the relationship between decryption security and key recovery security.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.