Cryptography: Concepts, Algorithms, and Security

Posted by on Jan 11, 2025 in Information Consulting and Management | 0 comments

Prime Numbers, GCD, and Congruence

Prime Numbers: Numbers > 1 with no divisors other than 1 & itself.

GCD: Largest positive integer dividing 2 numbers without a remainder.

Congruence: 2 numbers are congruent modulo N if they have the same remainder when divided by N (A ≡ B mod N).

Classical vs. Modern Cryptography

Classical Cryptography:

  1. Based on secrecy of the encryption algorithm.
  2. Key distribution was physical & therefore not as secure.
  3. Encryptions like the Caesar cipher were susceptible
Read More