/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

neilmadden.blog
| | words.filippo.io

NIST selected a post-quantum cryptographic KEM. We look at how it works and how we can use it for file encryption with age.
2.1 parsecs

Travel
| |
| | paragonie.com

A human-readable overview of commonly misused cryptography terms and fundamental concepts.
2.7 parsecs

Travel
| |
| | 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.
3.1 parsecs

Travel
| |
| | sergioprado.blog

This article is going to be an introduction to embedded Linux security.
19.6 parsecs

Travel
|