Tag

#Chinese Remainder Theorem

2 articles with this tag.

Classic Asymmetric Algorithms Intermediate

The Rabin Cryptosystem

The Rabin cryptosystem encrypts by squaring a number modulo n = pq. Learn how decryption finds four square roots with the Chinese remainder theorem, why redundancy is needed, why breaking it is as hard as factoring, and why a chosen-ciphertext attack still defeats the plain version.

Oct 19, 2026 18 min read

A visual representation of breaking RSA via Håstad's broadcast attack

Modern & Applied Cryptography Breakers Intermediate

Breaking RSA with Håstad's Broadcast Attack

A low public exponent like e=3 is efficient and, by itself, still safe. Broadcast the same message to three recipients using e=3 with no padding, and the Chinese Remainder Theorem recovers it with no private key at all.

Sep 12, 2026 10 min read

← All tags