New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Revisit reversible hash functions now that the CQF is available #1816

Open

ctb opened this issue Nov 11, 2017 · 4 comments

Member

ctb commented Nov 11, 2017

See #1441, #1442.

Idea is that since the CQF stores hashes, we would be able to retrieve hashes and then reverse them to get the k-mers (at least for k <= 32).

@betatim suggests keywords "avalanching" ("“small change makes big change in the hash value”) and maybe symmetric ciphers

@ctb looking at bit relocation and this link and this link.

Member Author

ctb commented Nov 11, 2017

also see https://gist.github.com/betatim/1d4ee182a62d00afb93b8f239285b735

Member Author

ctb commented Nov 14, 2017

Heng Li to the rescue: https://gist.github.com/lh3/59882d6b96166dfc3d8d

Member

betatim commented Nov 14, 2017

You thinking https://gist.github.com/lh3/59882d6b96166dfc3d8d#64-bit-mix-functions ?

Member Author

ctb commented Nov 14, 2017 via email

yes

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment