Tags
Articles using the Cryptography tag. Explore articles categorized by tags, making it easy to find content on specific topics
Chinese Remainder Theorem Simplified
The Chinese Remainder Theorem (CRT) sounds fancy but it is one of the most concrete and useful results in elementary number theory: it explains how a number can be completely described by its remainders when divided by several pairwise-coprime moduli...
Randomness in Cryptography: True Random Sources, Entropy, and Pseudorandom Generators Explained
Randomness is a word you hear in everyday life and in headlines about security breaches, but it hides subtle technical meaning. In cryptography, randomness is the backbone of secret keys, tokens, and nonces; when randomness fails, systems fail. What ...
Diffie–Hellman key exchange (Example in Golang)
The Diffie-Hellman key exchange protocol, named after its inventors Whitfield Diffie and Martin Hellman, is a fundamental method in cryptography for securely exchanging cryptographic keys over a public channel. Published in 1976, it was one of the ea...
Shamir's secret sharing algorithm (Example in Golang)
Shamir's Secret Sharing Algorithm stands out as a powerful tool for distributing and safeguarding secrets. In this article, I explore the complexities of Shamir's Secret Sharing Algorithm, delving into its fundamental principles, practical applicatio...
Secure multi-party computation (Example in Golang)
Multiparty Computation (MPC) is a cryptographic technique that enables multiple parties to jointly compute a function over their private inputs while keeping those inputs confidential. The primary goal of MPC is to allow computations on sensitive dat...