The following pages link to Fast Software Encryption (Q5713919):
Displaying 48 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- A simple variant of the Merkle-Damgård scheme with a permutation (Q431787) (← links)
- Optimal collision security in double block length hashing with single length key (Q522211) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- Open problems in hash function security (Q887443) (← links)
- A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration (Q1028435) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- Cryptanalysis and improvement of three certificateless aggregate signature schemes (Q1720502) (← links)
- Robust encryption (Q1753165) (← links)
- Security analysis of randomize-hash-then-sign digital signatures (Q1928773) (← links)
- Threshold ECDSA with an offline recovery party (Q2053769) (← links)
- Deterministic secure quantum communication against collective noise (Q2166478) (← links)
- The security of tandem-DM in the ideal cipher model (Q2397447) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- On ``A new quantum blind signature with unlinkability'' (Q2412622) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Some observations on the theory of cryptographic hash functions (Q2491271) (← links)
- On the collision and preimage security of MDC-4 in the ideal cipher model (Q2510658) (← links)
- Security analysis and improvement of a double-trapdoor encryption scheme (Q2572322) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions (Q2866733) (← links)
- On the Security of the Winternitz One-Time Signature Scheme (Q3011927) (← links)
- On chosen target forced prefix preimage resistance (Q3075866) (← links)
- On a family of preimage-resistant functions (Q3075868) (← links)
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions (Q3102787) (← links)
- The Symbiosis between Collision and Preimage Resistance (Q3104691) (← links)
- Security of Hash-then-CBC Key Wrapping Revisited (Q3104712) (← links)
- Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol (Q3178248) (← links)
- Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack (Q3294788) (← links)
- Минимизация коллизий при квантовом хешировании (Q3381820) (← links)
- Robust Encryption (Q3408211) (← links)
- MD4 is Not One-Way (Q3525692) (← links)
- Digital Signatures Out of Second-Preimage Resistant Hash Functions (Q3535355) (← links)
- VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095) (← links)
- Cryptanalysis of the GOST Hash Function (Q3600219) (← links)
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders (Q3634491) (← links)
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security (Q3634492) (← links)
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498) (← links)
- A Three-Property-Secure Hash Function (Q3644203) (← links)
- Bitcoin Crypto–Bounties for Quantum Capable Adversaries (Q5147157) (← links)
- How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
- The \(\mathcal{L_C}\)-structure-preserving algorithms of quaternion \(LDL^H\) decomposition and Cholesky decomposition (Q6080334) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model (Q6176275) (← links)
- Synchronization of fuzzy-chaotic systems with Z-controller in secure communication (Q6180009) (← links)
