/explore
|
You are here 
|
neilmadden.blog | ||
| | | | |
ochagavia.nl
|
|
| | | | | Here's a problem you might be familiar with: I keep forgetting what AEAD exactly means and why you would ever use it. Yes, I know the acronym stands for "Authenticated Encryption with Associated Data", but does that really clarify anything? Not to me, so I've finally decided to sit down and write this blog post as a piece of help for my future self... and for anyone else who finds AEAD hard to retain. | |
| | | | |
blog.cryptographyengineering.com
|
|
| | | | | In general I try to limit this blog to posts that focus on generally-applicable techniques in cryptography. That is, I don't focus on the deeply wonky. But this post is going to be an exception. Today, I'm going to talk about a topic that most "typical" implementers don't -- and shouldn't -- think about. Specifically:... | |
| | | | |
www.cesarsotovalero.net
|
|
| | | | | This article delves into symmetric and asymmetric encryption, as the building blocks of Public Key Infrastructure (PKI). It describes how PKI allows safeguarding the authenticity and security of digital communications across the internet. | |
| | | | |
rog3rsm1th.github.io
|
|
| | | The Okamoto-Uchiyama cryptosystem is a semantically secure, asymmetric encryption algorithm. It was first introduced in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The method is additive-homomorphic, which means that the plaintexts are added by multiplying two ciphertexts. It is therefore not necessary to decrypt the ciphertexts in order to be able to operate on the plaintexts. While searching for implementations of this algorithm on github, I realized that there were only two rough implementations. | ||
