1. In a very simplistic and step by step example, how do I get the 'w' values for SHA256?
  2. Does keyless encryption exist?

  3. Are there cryptographic hash functions that can be computed using only paper and pen without leaking any information about the plaintext?
  4. Hashing Resource ID Into Publicly Known Value Securely

  5. Backward Expansion of SHA1

  6. Why does Signal repeatedly hash the secure passphrase?

  7. Differences between sponge construction, hash function and random oracles.

  8. Public Key Encryption, how do you handle not trusting the middle man?
  9. How to perform Stampery.com's Merkle Proof?
  10. Can someone explain RSA-PSS to me?
  11. Will the ECDSA with SHA-3 implementation be quantum-proof?

  12. Are there two known strings which have the same MD5 hash value?

  13. Purpose of folding a digest in half
  14. Where did the SHAKEs come from in SHA3?

  15. Are there better alternatives to CRC32 for distributed download components hash calculation?
  16. Proving a Hash in Another Hash

  17. Collision-resistance of $H\Bigl(\bigl(H(m_1\mathbin\| 1)\oplus H(m_2\mathbin\|2)\oplus\dots\oplus H(m_n\mathbin\|n)\bigr)\mathbin\|n\Bigr)$?
  18. What was the first hash and what problem was it supposed to solve?
  19. What is a fast good-uniformity hash function that if it's seed and it's hash values are unknown, can be strong as cryptographic hash functions?

  20. What was NIST’s reason to switch naming from MD… (Message Digest) to SHA… (Secure Hashing Algorithm)?

  21. Why is $H(k\mathbin\Vert x)$ not a secure MAC construction?
  22. Create a CR hash function where truncating one bit leads to collisions
  23. Which algorithm has better performance (HMAC, UMAC, and Poly1305)?

  24. Textbook RSA signature not secure against existential forgery under known message attack?
  25. How would Keccak-1024
  26. Salt passwords with the username?
  27. What are preimage resistance and collision resistance, and how can the lack thereof be exploited?

  28. Why do we pad the length of the message at the end in Merkle–Damgård constructions?

  29. Why is SHA-3 a Sponge function?

  30. Similarity Identification on Encrypted Data

  31. Strength of Hash obtained by XOR of parts of SHA3

  32. Is there a variant of Merkle tree with no traceability from root to leaves?

  33. Anti-spamming hash-based proof-of-work?

  34. Can Whirlpool take advantage of AES-NI?

  35. Is it possible to retrive the Hash from an encrypted folder?
  36. Matyas–Meyer–Oseas for super-fast single-block hash function
  37. Stateless and deterministic number generation

  38. Securing the hotspot with maintaining Deep packet İnspection
  39. What is the current time limit of Keccak inversion?

  40. Multikeyed Hash: known algorithms?
  41. Does a concatenation of hashes of differently prefixed variations of any chosen message contain all possible finite bitstrings?

  42. Does there exist a highly irreversible hash function or a highly irreversible pseudo-random number generator?

  43. Encryption in popular compression file formats - 7zip, RAR, Zip

  44. Combining multiple hash functions for HKDF
  45. How does hashing help improve password security?

  46. Salt length for a single password

  47. Which symmetric encryption systems, pseudorandom number generators, and hash functions are best suited for reversible computers?

  48. Is it possible to break SHA-512?

  49. Doubts about Authenticated Data Structures logic

  50. How to prove that a hash or an encrypted message was obtained from a plaintext that has a certain pattern?

  51. What does "message schedule" mean in SHA-256?

  52. How does Truecrypt change password without the need for a complete re-encryption of volume

  53. Combining keys after key expansion: is it secure?

  54. Optimal way to bind two hashes

  55. Collision-free one-wayish function mapping 32 bit to 32 bit

  56. collision and pre-image difference

  57. How to hash elliptic curve point to a binary string

  58. Is it cryptographically safe to replace initialization buffer of hash function with random data?

  59. XOR Encryption with bcrypt password de-biasing

  60. Can someone please design a hash function based scheme and solve this problem for me?

  61. linear cryptanalysis of hash function

  62. AUTHENTIFY MERKLE TREE: In the passage below how is A able to confirm YB in the public file only knowing R, log2 intermediate values, and YB itself?

  63. Does preimage resistance and/or collision resistance imply the infeasiblility of finding fixed points in hash functions?

  64. Why is plain-hash-then-encrypt not a secure MAC?

  65. Are there any known values for common hashes known to have no preimage

  66. Difference between H(A)+H(B) and H(A+B)
  67. Is a hash function based on multiple nested iterations of HMAC-SHA-256 cryptographically weaker than SHA-512?
  68. Use case for extendable-output functions (XOF) such as SHAKE128/SHAKE256
  69. Difficulty of generating a string "The (md5|sha1) hash of this string is (x)" that hashes to (x) vs. regular hash collision between files?
  70. Salt and pepper at both client and server sides?

  71. Why is H(k || m || k) secure against birthday attack?
  72. For any 256 bit string, is there some input to SHA256 that produces this string?

  73. Designing a hash function from first principles rather than depending on heuristics

  74. Is SHA-1 still practically secure under specific scenarios?

  75. What are the odds of collisions for a hash function with 256-bit output?
  76. A strange phenomenon of the composition of permutations of order 2

  77. Implementing Target collision resistant hash function
  78. Making attacks on password hashes less economical

  79. I think PBKDF2 may be better than Scrypt? Looking for someone to point out my logical error

  80. Notation question for hash functions
  81. Are Edon-R 512 and Blue Midnight Wish 512 safe/recommendable?
  82. Winternitz-OTS+ with Poly1305

  83. Do identical strings always have the same SHA-256 value?

  84. eXtended Merkle Signature Scheme (XMSS) vs Leighton-Micali Signature (LMS)
  85. Proving/verifying keys for zero knowledge proof (zkSNARK) in a simple case (possession of a string whose hash is x)
  86. Tamperable hash function

  87. Why hash ( clear text + Secret ) instead of hash (encrpt(clear text) [ + secret ] )
  88. Exchanging pre-image of hash over a network securely

  89. salt usage for hashed password storage - design consideration

  90. BLS aggregate signatures for relay node non-interactive incentive accounting
  91. Hashing list: concatenation vs prepending

  92. HMACSHA256 2.5 times faster than HMACSHA512

  93. Best way to hash two values into one?

  94. Is it possible to find two sets such that their hash xor summation is the same?
  95. Why a Blockchain cannot confirm "Membership Proof" as can a Merkle Tree?

  96. Tamper-proofing log files
  97. What is the relation between the existence of a cryptographic hash function and the existence of a PRG?
  98. How unique and secure are verification codes created from different hashes?
  99. Can we modify any hash function like SHA-1 or MD5 to perform multiple iterations at once to gain calculation speed?

  100. SHA-1 collisions - what about practical attacks?