How provably secure are cryptographic primitives used in practice
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Semantics and Syntax: A Legacy of Alan Turing
We will discuss how ‘provably secure’ are several cryptographic primitives of practical relevance. Examples include OAEP encryption and Full Domain Hash Signatures.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|