scientific article; zbMATH DE number 3877077
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) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
This book is a revision of author's thesis and presents the results obtained between 1974 and 1979. The two first chapters have an introductory character. Chapters 3 and 4 describe the first public key distribution system and public key cryptosystem, which are both based on the concept of a puzzle. Now, as the author himself says, they are primarily of pedagogical and historical interest. Chapter 5 concerns certified digital signature systems - the Lamport-Diffie one time signature and its improved version. The next chapters, entitled The trapdoor knapsack and How secure the trapdoor knapsack describe a public key cryptosystem based on the knapsack problem. They are a study from several perspectives in an attempt to determine its security and what type of trapdoor knapsack is suitable for actual implementation. A conventional cipher which is essentially NP-complete is given in chapter 8. Chapter 9 Protocols for public key cryptosystems examines the problems and techniques of actually using public key systems, and the strengths they offer by giving a series of example protocols. In the last chapter two methods of multiple encryption using DES are analysed and are shown to be less secure than at their first appearance. Regardless the rapid development and increasing number of papers on cryptography the book is very useful reading.
- Confidential and efficient asset proof for bitcoin exchanges
- Static-memory-hard functions, and modeling the cost of space vs. time
- The hunting of the SNARK
- Public key compression for constrained linear signature schemes
- Security analysis of randomize-hash-then-sign digital signatures
- Simple hash function using discrete-time quantum walks
- New records of pre-image search of reduced SHA-1 using SAT solvers
- Construction of one-way hash functions with increased key space using adaptive chaotic maps
- An intermediate secret-guessing attack on hash-based signatures
- Blockchain technology: issues of analysis and synthesis
- Hash function based on quantum walks
- Post-quantum cryptography: state of the art
- An efficient post-quantum one-time signature scheme
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Bounded-retrieval model with keys derived from private data
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
- scientific article; zbMATH DE number 4041784 (Why is no real title available?)
- Public-key cryptography
- The universality of iterated hashing over variable-length strings
- A Data Concealing Technique with Random Noise Disturbance and a Restoring Technique for the Concealed Data by Stochastic Process Estimation
- On the security of compressed encodings
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- Collapseability of tree hashes
- Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
- 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
- Security of truncated permutation without initial value
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
- A New Approach to Constructing Digital Signature Schemes
- Fiat-Shamir security of FRI and related SNARKs
- Digital friend-or-foe authentication
- Proof of availability and retrieval in a modular blockchain architecture
- Non-interactive anonymous router with quasi-linear router computation
- At the top of the hypercube -- better size-time tradeoffs for hash-based signatures
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- Breaking X-VRF, a post-quantum verifiable random function (short paper)
- HBSS: (simple) hash-based stateless signatures -- hash all the way to the rescue!
- Sandwich BUFF: achieving non-resignability using iterative hash functions
- On the cryptographic futility of non-collapsing measurements
- Aborting random oracles: how to build them, how to use them
- Permutation-based hash from non-idealized assumptions: adding feed-forward to sponge
- Shorter hash-based signatures using forced pruning
- Unintended features of APIs: cryptanalysis of incremental HMAC
- Optimal trade-off for Merkle tree traversal
- Open problems in hash function security
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342347)