Today Neil talked about a variety of (symmetric) cryptography topics and formal security models for them.
In order of likelihood that we’ll get to them, topics include: one-time-pad, perfect secrecy, block ciphers and their modes of operation, IND-CPA, IND-CCA, PRF, hash functions, collision-resistance, the Merkle-Damgård construction, and hash-length extension attacks.
Previous: Cholesky Factorization by Gaussian Process Regression
Today Stephen talked about ongoing research: how the interplay between numerical linear algebra, statistical inference, and information theory can be exploited to yield better algorithms for classic problems in scientific computing.
continue reading ❯