Public-Key Cryptography – Part 2

$0.00

Lab 6 extends the mathematical foundations for modular arithmetic and public-key systems through guided Python practice. Work through Exercise 6, the Extended Euclidean Algorithm and modular inverses used in RSA key generation, and Exercise 7, Euler’s Phi Function and its connection to RSA. Pages: 45. Lab 6 · Guided Python practice

Description

Lab 6 extends the mathematical foundations for modular arithmetic and public-key systems through guided Python practice. Work through Exercise 6, the Extended Euclidean Algorithm and modular inverses used in RSA key generation, and Exercise 7, Euler’s Phi Function and its connection to RSA.

Topics covered

  • Extended Euclidean Algorithm
  • Bezout coefficients
  • Modular multiplicative inverses
  • RSA key generation
  • Euler’s Phi (totient) function
  • Guided Python practice

Pages: 45 · Lab 6 · Guided Python practice

Free download after free checkout. You will need a free CyberTekie account; download available from My Account > Downloads after checkout.

Reviews

There are no reviews yet.

Be the first to review “Public-Key Cryptography – Part 2”

Your email address will not be published. Required fields are marked *