Hill Cipher Explained (with Example)

Поделиться
HTML-код
  • Опубликовано: 1 янв 2025
  • In this video I walk through the basics of the Hill cipher!
    Link to Python implementation: • Cryptography: Hill Cip...

Комментарии • 22

  • @Croccifixo
    @Croccifixo 4 года назад +24

    When the example in the beginning of Linear Algebra changes, some earlier mistake persists, and instead of showing [1*5 + 2*6] = [17], it shows [1*2 + 5*6] = [32]

    • @AladdinPersson
      @AladdinPersson  4 года назад +3

      Yeah that was an odd mistake, I showed it correctly then I guess I mistakenly wrote 5 instead of the 2. Thanks for catching that mistake

    • @kylencannon1524
      @kylencannon1524 3 года назад

      Pro trick : you can watch series on KaldroStream. Me and my gf have been using it for watching loads of movies during the lockdown.

    • @kamryncallen8519
      @kamryncallen8519 3 года назад

      @Kylen Cannon yup, I have been watching on Flixzone} for since december myself =)

    • @marcelomaxton4213
      @marcelomaxton4213 3 года назад

      @Kylen Cannon Definitely, I've been using flixzone} for since december myself =)

    • @ryuofthenorth
      @ryuofthenorth Год назад +3

      @@kylencannon1524 Sorry I dont have a GF

  • @theredknight9314
    @theredknight9314 Год назад +2

    I am deeply confused.
    In the final decryption formula. How do i use the k-1 and the C together?
    Is it the same as in the begging?
    As in when i am decrypting do i do 15x17 plus 7 x 8 when decrypting like when you encrypt
    Or do i do something else with the numbers?
    Also how does 3 3 2 5 work? It shares a divisor of 3 with 26 so it cant work.

  • @sooryaku1
    @sooryaku1 4 года назад +4

    Great video, I finally understood the concept :)

  • @3liyyahu591
    @3liyyahu591 2 года назад

    In 9:41 I don't get how the mod obly changes 2 of the numbers

  • @dexterwong2277
    @dexterwong2277 3 года назад +1

    Great explanation! Keep up the good work

  • @9wattcat
    @9wattcat 2 года назад

    Tack så mycket! Du räddade tentan

  • @manjunathkavishetti4619
    @manjunathkavishetti4619 Год назад

    sir here u have divided text to n*1 matrix..but some of the channels used 1*n matrix which is correct ?

  • @mubeth24
    @mubeth24 4 года назад +3

    i can’t get it how 9^-1 modulo 26 is 3

    • @AladdinPersson
      @AladdinPersson  4 года назад +6

      In these simple cases when we have small numbers you can think of it like this, 9 * something = 1 (mod 26), if you try out different values for "something" you get: 9 * 3 = 27 = 1 (mod 26). That's how in this specific example, for the general case I suggest you learn about The Extended Euclidean Algorithm. There are other great videos on RUclips to learn that! Hope that helps

    • @SHOBRUNJB
      @SHOBRUNJB 4 года назад +1

      Mubeth Praditya mantep le sinau beth, warai aku :)

  • @eligoodyggg7120
    @eligoodyggg7120 9 месяцев назад

    why is k 9?

  • @lilhan3752
    @lilhan3752 3 года назад +1

    why mod (26)

  • @surgeonrx3
    @surgeonrx3 3 года назад

    7:35 google search says "do you mean Hill cipher is complicated"

  • @minomasters7527
    @minomasters7527 4 года назад +2

    thank you very much

  • @SpenxCR
    @SpenxCR Год назад

    there are a lot of mistakes within this video that causes unneeded confusion, I recommend proof hearing your videos in the future as I was rewinding many times as you say numbers equals a completely different number, for example you say that inverted k becomes 3, -3 etc but you call "2", '-3' which makes me think there are now two -3's.