Explore >> Select a destination

You are here

 words.filippo.io
Go 1.20 Cryptography
| | andrea.corbellini.name
Elliptic Curve Cryptography: ECDH and ECDSA - Andrea Corbellini
1.9 parsecs away

Travel
| | [AI summary] This technical blog post explains the mathematical principles, key generation, and implementation details of Elliptic Curve Cryptography (ECC) covering domain parameters, verifiably random curves, ECDH key exchange, and ECDSA signatures.
| | cronokirby.com
Constant-Time Big Numbers: An Introduction - Cronokirby
1.9 parsecs away

Travel
| | - Read more: https://cronokirby.com/posts/2021/04/constant-time-big-numbers-introduction/
| | www.cesarsotovalero.net
A Prime on Public Key Infrastructure
3.1 parsecs away

Travel
| | 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.
| | www.jeremykun.com
Estimating the Security of Ring Learning with Errors (RLWE) || Math ? Programming
23.7 parsecs away

Travel
| 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. The basis for many FHE schemes, as well as other privacy-preserving protocols, is the Learning With Errors (LWE) problem.