Greatest Common Divisor

video-placeholder
Loading...
Ver programa

Destrezas que aprenderás

Number Theory, Cryptography, Modular Exponentiation

Reseñas

4.5 (538 calificaciones)

  • 5 stars
    68,95 %
  • 4 stars
    21,18 %
  • 3 stars
    5,57 %
  • 2 stars
    1,30 %
  • 1 star
    2,97 %

TK

27 de may. de 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

4 de feb. de 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.

De la lección

Euclid's Algorithm

Impartido por:

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Alexander S. Kulikov

    Professor

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.