Explore >> Select a destination
|
You are here 
|
www.ayoub-benaissa.com | ||
| | | | |
neilmadden.blog
|
|
| | | | | Note: this post will probably only really make sense to cryptography geeks. In "When a KEM is notenough", I described how to construct multi-recipient (public key) authenticated encryption. A naïve approach to this is vulnerable to insider forgeries: any recipient can construct a new message (to the same recipients) that appears to come from the... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | This article was written by my colleague, Cathie Yun. Cathie is an applied cryptographer and security engineer, currently working with me to make fully homomorphic encryption a reality at Google. She's also done a lot of cool stuff with zero knowledge proofs. In previous articles, we've discussed techniques used in Fully Homomorphic Encryption (FHE) schemes.... | |
| | | | |
awwalker.com
|
|
| | | | | This post discusses the problem of computer-assisted decryption of un-parsed substitution ciphers. Sample Mathematica code is linked within. | |
| | | | |
blog.trailofbits.com
|
|
| | | This post will examine the cryptography behind passkeys, the guarantees they do or do not give, and interesting cryptographic things you can do with them, such as generating cryptographic keys and storing certificates. | ||
