Greatest Common Divisor

video-placeholder
Loading...
查看授课大纲

您将学习的技能

Number Theory, Cryptography, Modular Exponentiation

审阅

4.5(538 个评分)

  • 5 stars
    68.95%
  • 4 stars
    21.18%
  • 3 stars
    5.57%
  • 2 stars
    1.30%
  • 1 star
    2.97%

TK

May 27, 2020

I cant think of any other best way of presenting cryptography to beginners. Everything presented in the course has some connection to cryptography, really enjoyed RSA quest.

TV

Feb 4, 2021

Thank you! enjoyed learning number theory, understood new concepts of modular programming, how public key -private key works and the basis of rsa algorithm.

从本节课中

Euclid's Algorithm

教学方

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Alexander S. Kulikov

    Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。