from Hacker News

Show HN: Beamsplitter – Hash function that uses only S-boxes

by archivist1 on 1/18/20, 1:05 PM with 10 comments

• by arkadiyt on 1/19/20, 8:56 PM

  Let's ignore for a second the question of security (is it collision/pre-image resistant? Dieharder says nothing about this).

  As a developer, is the fact that it only uses S-boxes supposed to be beneficial to me somehow? Does this mean it runs faster? Uses less memory? Is it an academic exercise? Why would I use this over a different hash function?

• by mmastrac on 1/19/20, 9:06 PM

  > I went to random.org and generated 32 sets of 256 no-repeat numbers between 0 and 255 inclusive.

  One suggestion I'd have here would be using "nothing-up-my-sleeve" numbers like pi/e/log2 in hex. [1]

  [1] https://en.wikipedia.org/wiki/Nothing-up-my-sleeve_number

• by xscott on 1/19/20, 9:03 PM

  Saving a Google search for those (like me) who don't know what S-boxes are: https://en.wikipedia.org/wiki/S-box

• by cafxx on 1/19/20, 11:44 PM

  I sincerely hope the author will urgently and clearly mark the repo as a toy/demo/do not use for anything important in the readme.