The following pages link to (Q3342347):
Displayed 31 items.
- The universality of iterated hashing over variable-length strings (Q412371) (← links)
- Unintended features of APIs: cryptanalysis of incremental HMAC (Q832351) (← links)
- Optimal trade-off for Merkle tree traversal (Q870836) (← links)
- Open problems in hash function security (Q887443) (← links)
- Confidential and efficient asset proof for bitcoin exchanges (Q1615407) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Security analysis of randomize-hash-then-sign digital signatures (Q1928773) (← links)
- Simple hash function using discrete-time quantum walks (Q1993832) (← links)
- New records of pre-image search of reduced SHA-1 using SAT solvers (Q2079908) (← links)
- Construction of one-way hash functions with increased key space using adaptive chaotic maps (Q2128158) (← links)
- An intermediate secret-guessing attack on hash-based signatures (Q2128758) (← links)
- Blockchain technology: issues of analysis and synthesis (Q2320244) (← links)
- Hash function based on quantum walks (Q2322065) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- An Efficient Post-Quantum One-Time Signature Scheme (Q2807220) (← links)
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman (Q2835601) (← links)
- Bounded-Retrieval Model with Keys Derived from Private Data (Q2980861) (← links)
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru (Q3525694) (← links)
- A Data Concealing Technique with Random Noise Disturbance and a Restoring Technique for the Concealed Data by Stochastic Process Estimation (Q4964359) (← links)
- On the Security of Compressed Encodings (Q5019335) (← links)
- A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (Q5019338) (← links)
- Collapseability of Tree Hashes (Q5041240) (← links)
- Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy (Q5056036) (← links)
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice (Q6080919) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Security of truncated permutation without initial value (Q6132428) (← links)
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions (Q6163945) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6163946) (← links)
- Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256 (Q6166999) (← links)