1. Prove integer is within the interval [a,b]
  2. HMAC-SHA256 for hashing of credit card PANs?

  3. Can we prove that an element in a fractal tree traces back to a certain point?

  4. Can I construct a feasible stream cipher out of HMAC and a secure hash algorithm?

  5. Security of a sha-256 based stream xor cipher?
  6. Are cryptographic hash functions quantum secure?

  7. Why is it not possible to use a hashed password to log in?
  8. What is the difference between Argon2d and Argon2i?

  9. What are the odds of collisions for a hash function with 256-bit output?

  10. Is there a quick way to know the length of a message hashed using SHA3?

  11. Is it possible to actually verify a “sponge function” security claim?

  12. Properties of PRNG / Hashes?

  13. Anti-spamming hash-based proof-of-work?
  14. One Time Pad change by third party?
  15. How Secure is Hash-based Bit Commitment?

  16. Why it is necessary idealized hash functions in Random Oracle Model?
  17. Hash function and Digital Excryption Algorithm

  18. How can I prove the result of a long computation with a short string?
  19. Are there predictable, yet secure hashes?

  20. How can I prove `sha256^1000000000(X) = Y` for a verifier that can't perform that much computations?

  21. Difference between UF-CMA and UF-CMVA security

  22. Comparing different hashes to confirm they came from the same string

  23. How many unique elements are generated by the equation in DSA for r?

  24. How robust is RSA-FDH against distribution bias?
  25. What are the properties of a function based on multiple iterations of a pseudo-random permutation?
  26. Is triple-CRC-32 a bad (or not) idea for generating a uniform distribution hash?
  27. Why does RFC8032#8.7 state that the IUF hash API should not be used for Ed25519?
  28. XOR Encryption with bcrypt password de-biasing
  29. Is the SHA-family of hash functions surjective onto their domain with each element equally likely?
  30. Hash function construction security resistance

  31. GOST R 34.11-2012 hash function works from the end, is this convenient in practice?

  32. How is a "SHA256 reduced by X of Y rounds" built?

  33. Would this hash functionality fall under pre-image resistance or collision resistance?
  34. Winternitz One time signature security
  35. Questions about the argon2 options

  36. Is there a method for creating a single digest from multiple messages and query from any message?
  37. How do you use the Tiger hash function with GPG?

  38. Would possessing a string with the sha-256 hash of all zeros lead to an attack on sha-256?

  39. What is best practise for salting and multiple-hashing of passwords?
  40. Review of "equitable" proof-of-work systems

  41. Cryptocurrency serving as hash breaking?
  42. Computational requirements for breaking SHA-256?

  43. How should I incrementally sign a large set of documents?

  44. Is there an advantage to "weak" hashing and stretching over strong hashing?

  45. Minimum difference collision metric

  46. Birthday attack problem, computing the sample r given hash function H with the output $N = 10^{20}$?
  47. "hash trail", iterative hash function that can be traced back along many steps

  48. How do you get the original salt after it's been hashed to the user's password in the database?

  49. Example of a hash function that can mutate many times and still trace back to the original hash and know how many times it has mutated

  50. Do protocols for cryptographic proof of when elements in a fractal tree diverged exist?
  51. Can I generate OTP secrets by using a hash?

  52. Is this the right approach to proving that omitting input length in the Merkle-Damgard transform is insecure?

  53. What is a universal hash function?

  54. Can you help me understand what a cryptographic "salt" is?
  55. CCA-Security Proof of a particular scheme

  56. Collision resistance in a hash function
  57. What is the theoretical time limit of Keccak inversion?

  58. Is the seed block in Argon2 (H0) 64-bit or 64-byte?
  59. Advantages of using intermediate hash over full hash in digital signature application
  60. Collision resistance of hash function built on modular exponentiation

  61. Winternitz hash based signature signing and verification

  62. hashing and message input size

  63. Getting the key used for HMAC given the hash and the plaintext?
  64. Is it secure to "cut" a hash?

  65. Need for secure hash function for a bloom filter

  66. Does this use of hash provide anything over a nonce? HMAC instead?

  67. How to implement a hash function $H \colon \{0,1\}^* \to \mathbb{Z}_p^*$?
  68. Time to calculate hash with n leading zeros

  69. SHA512 faster than SHA256?

  70. Are there any well-known examples of SHA-256 collisions?
  71. Why Is XOR of 2 collision resistant hash functions not a collision resistant?
  72. Using non-standard constants for SHA-256

  73. Is there a way to know if a cleartext substring is present in a hash?

  74. Self Generating key encryption based

  75. ECDSA: What is the purpose of adding a hash of the used certificate to the signed data?
  76. How can you tell which hash function was used to generate a hash value?

  77. Hash ElGamal CCA approach

  78. What is the expected number of different sequences of bits in the collection that contains $2^{800}$ elements?

  79. SHA256 and RIPEMD160 collisions

  80. Key Derivation Functions offering better than 2^hlen security?
  81. Is a message digest useful with symmetric encryption to check for integrity?

  82. Collision Resistant Hashing from One-Way Functions?
  83. Birthday attack against SHA256
  84. What is the best and fastest algorithm to generate a hash collision?

  85. What to do with a last chunk of 503 bits in SHA1?
  86. What are preimage resistance and collision resistance, and how can the lack thereof be exploited?
  87. Testing hash functions for collision resistance
  88. Cryptographic hasing functions init-update-final

  89. Determining if a hash function is preimage resistant or strongly collision-free
  90. Does a distinguisher for an PRF based on a hash make the hash function insecure?
  91. How many hash functions must Bob compute to find a solution?

  92. Is the Keccak family of sponge constructions the same as SHA-3?

  93. Fastest algorithm for message authentication?

  94. Is it possible to apply a function to an $xkN$-bit block and increase the number of security bits to $xN$ if a PRF/PRP operates on $N$-bit blocks?
  95. Cryptography algorithms that take longer to solve on a GPU than a CPU
  96. Is whirlpool vulnerable to length extension attack?

  97. Why is multiplication uncommon in cryptographic primitives?

  98. eavesdropping on sha 256 consist of two entries one is public is secure
  99. Is it safe to use the hash of the data as the key to encrypt them?
  100. Salts, how does the script know what the salt is?