scientific article
From MaRDI portal
Publication:3342347
zbMath0549.94022MaRDI QIDQ3342347
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) History of information and communication theory (94-03) Authentication, digital signatures and secret sharing (94A62)
Related Items (31)
Confidential and efficient asset proof for bitcoin exchanges ⋮ Construction of one-way hash functions with increased key space using adaptive chaotic maps ⋮ Collapseability of Tree Hashes ⋮ An intermediate secret-guessing attack on hash-based signatures ⋮ Unintended features of APIs: cryptanalysis of incremental HMAC ⋮ Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy ⋮ Optimal trade-off for Merkle tree traversal ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Open problems in hash function security ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ The universality of iterated hashing over variable-length strings ⋮ Security of truncated permutation without initial value ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256 ⋮ The hunting of the SNARK ⋮ New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru ⋮ Bounded-Retrieval Model with Keys Derived from Private Data ⋮ Public key compression for constrained linear signature schemes ⋮ Simple hash function using discrete-time quantum walks ⋮ Post-Quantum Cryptography: State of the Art ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ A Data Concealing Technique with Random Noise Disturbance and a Restoring Technique for the Concealed Data by Stochastic Process Estimation ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Blockchain technology: issues of analysis and synthesis ⋮ Hash function based on quantum walks ⋮ New records of pre-image search of reduced SHA-1 using SAT solvers ⋮ On the Security of Compressed Encodings ⋮ A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
This page was built for publication:
