Password security, hashes and rainbow tables PART 1

Поділитися
Вставка
  • Опубліковано 21 гру 2024

КОМЕНТАРІ •

  • @FuSiOn_33301
    @FuSiOn_33301 2 роки тому

    The explanation is very good and easy to understand.

  • @user-pu8ft6cq6k
    @user-pu8ft6cq6k 2 роки тому

    I have a question about the password more than 3 letters, what if the letters equal to more than all the numbers of the letters?

  • @jacorream
    @jacorream 10 років тому +7

    Good explanation, but these aren't rainbow tables, these are only precomputed tables.

  • @LucidEnigma21
    @LucidEnigma21 11 років тому +1

    Good job man! :D

  • @TOn-fx2gr
    @TOn-fx2gr 5 років тому

    Everyone says that hash is irréversible why ?? I think that if we Know how it was mad WE CAN juste reverse every step from the end to the beginig . Pls if someone Know how md5 is made step by step tell me in wiki its complications

    • @TOn-fx2gr
      @TOn-fx2gr 5 років тому

      Omg never mind i got it

  • @faisalalbarrak
    @faisalalbarrak 11 років тому +1

    Thank you man... very good info.

  • @pk7685
    @pk7685 11 років тому +1

    very understandable

  • @jo31087
    @jo31087 11 років тому

    Great video did a great job explaining this

  • @datajunkie3427
    @datajunkie3427 11 років тому +3

    This is too simplified. What about reduction function and chaining?

  • @jg9193
    @jg9193 3 роки тому

    Down voting because no discussion of the reduction function