query: Can a hash function be cyclic?
positive_passages.docid: 147359
positive_passages.text: Can I retrieve a re-hashed (hash) value, for instance by additional hashing?
negative_passages.docid: 96429
negative_passages.text: How do hashes really ensure uniqueness?
negative_passages.docid: 25744
negative_passages.text: Multiplication in Permutation Groups Written in Cyclic Notation
negative_passages.docid: 115736
negative_passages.text: What's a correct and good way to implement __hash__()?
negative_passages.docid: 26950
negative_passages.text: Is there a string that's hash is equal to itself?
negative_passages.docid: 109037
negative_passages.text: Differences between hash- and encryption algorithms?
negative_passages.docid: 70225
negative_passages.text: Do identical strings always have the same SHA-256 value?
negative_passages.docid: 11080
negative_passages.text: Are common cryptographic hashes bijective when hashing a single block of the same size as the output?
negative_passages.docid: 83963
negative_passages.text: Proving knowledge of a preimage of a hash without disclosing it?
negative_passages.docid: 5931
negative_passages.text: Why can't I reverse a hash to a possible input?
negative_passages.docid: 133525
negative_passages.text: Easily reversible hash functions as a method of data transmission
negative_passages.docid: 153013
negative_passages.text: How to implement an efficient bidirectional hash table?
negative_passages.docid: 41777
negative_passages.text: Hash functions to generate a one-time pad
negative_passages.docid: 92252
negative_passages.text: how to use these hash functions in python?
negative_passages.docid: 9414
negative_passages.text: Is There a Natural Way to Extend Repeated Exponentiation Beyond Integers?
negative_passages.docid: 29312
negative_passages.text: Stream Ciphers and cycling questions
negative_passages.docid: 136965
negative_passages.text: SHA-256 "almost unique"?