Tag: Cryptography - Page 2 - Shakil Mahmud Shazal

Modern Cryptography & Zero-Knowledge Proofs (Part 10): Zero-Knowledge Foundations: Interactive Proofs, Goldwasser-Micali-Rackoff & Arthur-Merlin Games

Computational complexity classes IP and AM, the Goldwasser-Micali-Rackoff framework, simulator paradigms, and zero-knowledge Graph 3-Coloring.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 09): Commitment Schemes & Verifiable Computation: Pedersen & Polynomial Commitments (KZG)

Hiding and binding properties, additively homomorphic Pedersen commitments, polynomial commitments, and the Kate-Zaverucha-Goldberg (KZG) scheme.

Nov 9, 2026 • 4 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 08): Digital Signatures & Threshold Schemes: ECDSA, Ed25519, Schnorr & Shamir Secret Sharing

Signature security models, ECDSA nonce vulnerabilities, Schnorr linearity, multi-signatures (MuSig2), and Shamir (k,n) threshold secret sharing.

Nov 9, 2026 • 4 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 07): Pairing-Based Cryptography: Weil & Tate Pairings, BLS Signatures & Identity-Based Encryption

Bilinear maps on elliptic curves, Weil and Tate pairings, Miller's algorithm, BLS signature aggregation, and Boneh-Franklin IBE.

Nov 9, 2026 • 4 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 06): Elliptic Curve Cryptography: Group Laws, Weierstrass Forms & Edwards Curves

Algebraic geometry over finite fields, chord-and-tangent group law, Montgomery and Twisted Edwards curves, Curve25519, and scalar multiplication.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 05): Public-Key Cryptography & Number-Theoretic Hardness: RSA, Diffie-Hellman & Discrete Logs

Computational number theory, trapdoor one-way permutations, RSA factoring bounds, Diffie-Hellman key exchange, and index calculus algorithms.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 04): Message Authentication Codes & Authenticated Encryption (AEAD, GCM, ChaCha20-Poly1305)

HMAC security reductions, authenticated encryption paradigms, AES-GCM Galois field polynomial GHASH, and ChaCha20-Poly1305.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 03): Cryptographic Hash Functions: Merkle-Damgård, Sponge Constructions & Keccak/SHA-3

Collision resistance, Merkle-Damgård length-extension vulnerabilities, Sponge constructions, and the Keccak-f[1600] permutation in SHA-3.

Nov 9, 2026 • 4 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 02): Symmetric Primitives: Feistel Networks, AES S-Box Design & Differential Cryptanalysis

Block cipher design, Luby-Rackoff security of Feistel ciphers, Rijndael Galois field GF(2^8) S-box algebra, and linear/differential cryptanalysis bounds.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 01): Foundations of Provable Security: One-Way Functions, Hard-Core Predicates & The ROM

Computational complexity foundations, one-way functions, Goldreich-Levin hard-core predicates, pseudorandom generators, and the Random Oracle Model in provable security.

Nov 9, 2026 • 4 min read

Learner Portal & Sync

Enrolled Academic Curricula (43 Disciplines)

My Earned Credentials

The Great Equations (MATH-101)

Loading question...