sorted by: new top controversial old
Mathematical Proof that memory hardness is not reversible? in c/crypto@infosec.pub
[–] [S] 1 point 1 month ago (1 child)

huh, i think i know understand it better. it works that hashing steps builds on multiple hashing steps together from previous rounds, which increase storage consumption. but i still do not understand, why less storage consumption makes pbkdf2 for example faster to crack in fpga

  • permalink
  • fedilink
  • source
    •
    2
    Mathematical Proof that memory hardness is not reversible? (infosec.pub)
     

    Hello, i have a question. I understand that government institutions probably do not want to certify memoryhard KDFs like argon* (because government agencies cannot bruteforce for clandestine or forensic purporses) but sometimes i wonder, if there is actual mathematical proof, that memory hardness like done for argon, scrypt and co. cannot be reverse into more bruteforce with a timetradeoff.

    Can anyone explain this to me, because i feel like i do not understand something?

    - a neat hack for the properly paranoid - Your computer is likely generating random noise on your sound card in c/crypto@infosec.pub
    Is there an "Avoid Amazon" community for people who want to support smaller online retailers? in c/nostupidquestions@lemmy.world