SOL Prep

Computational Methods

Virginia SOL DM.CM.3

Identify and apply cryptographic methods.

Study DM.CM.3 with SOL PrepBack to Discrete Mathematics

What students need to be able to do

  • Compare and contrast ciphers and codes.
  • Describe the evolution of cipher systems.
  • Identify the Fundamental Theorem of Arithmetic.
  • Describe how the complexity of prime factorization is used in cryptography.
  • Describe modular arithmetic in context (e.g., clocks, days of the week, measures of time).
  • Analyze the relationship between divisibility and modulus.
  • Determine congruence within modular arithmetic.
  • Perform operations within modular arithmetic.
  • Apply modular arithmetic to problems in context (e.g., cryptography, ISBN, IBAN).