Greatest Common Divisor

Loading...
查看授課大綱

您將學習的技能

Number Theory, Cryptography, Modular Exponentiation

審閱

4.6(324 個評分)
  • 5 stars
    69%
  • 4 stars
    23%
  • 3 stars
    5%
  • 2 stars
    1%
  • 1 star
    2%
L

Jan 02, 2018

A good course for people who have no basic background in number theory , explicit clear explanation in RSA algorithm. Overall,a good introduction course.

PS

Jun 14, 2020

Its a good course to the beginers of cryptography.If you want to join you should know basic number theory and computer language python.

從本節課中
Euclid's Algorithm

教學方

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Vladimir Podolskii

    Vladimir Podolskii

    Associate Professor

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。