The following pages link to (Q3212279):
Displayed 50 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier (Q293718) (← links)
- New second-preimage attacks on hash functions (Q321303) (← links)
- Cryptanalysis of full \texttt{RIPEMD-128} (Q321321) (← links)
- A structure-based chaotic hashing scheme (Q327795) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- Keyed hash function based on a chaotic map (Q425540) (← links)
- A simple variant of the Merkle-Damgård scheme with a permutation (Q431787) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- Forgery attack on one-time proxy signature and the improvement (Q481636) (← links)
- MJH: a faster alternative to MDC-2 (Q498970) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- Increasing the flexibility of the herding attack (Q763502) (← links)
- Unintended features of APIs: cryptanalysis of incremental HMAC (Q832351) (← links)
- Open problems in hash function security (Q887443) (← links)
- Collision attack on \({\mathtt Grindahl}\) (Q901374) (← links)
- A countable and time-bound password-based user authentication scheme for the applications of electronic commerce (Q1006746) (← links)
- On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- A new key authentication scheme based on discrete logarithms (Q1406193) (← links)
- LWDSA: light-weight digital signature algorithm for wireless sensor networks (Q1637662) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- New second preimage attacks on dithered hash functions with low memory complexity (Q1698640) (← links)
- Multi-party quantum key agreement without entanglement (Q1705075) (← links)
- How to sign digital streams (Q1854413) (← links)
- Security analysis of randomize-hash-then-sign digital signatures (Q1928773) (← links)
- Simple hash function using discrete-time quantum walks (Q1993832) (← links)
- Semi-quantum protocol for deterministic secure quantum communication using Bell states (Q1994781) (← links)
- Semi-quantum key agreement and private comparison protocols using Bell states (Q2011013) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Cryptanalysis of SHA-0 and reduced SHA-1 (Q2018819) (← links)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- A quantum hash function with grouped coarse-grained boson sampling (Q2102295) (← links)
- Collision-resistant and pseudorandom function based on Merkle-Damgård hash function (Q2104455) (← links)
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound (Q2119014) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- A note on quantum collision resistance of double-block-length compression functions (Q2149791) (← links)
- Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160 (Q2182064) (← links)
- Semi-quantum proxy signature scheme with quantum walk-based teleportation (Q2208002) (← links)
- Cryptanalysis of MD2 (Q2267363) (← links)
- Hash function based on quantum walks (Q2322065) (← links)
- The rebound attack and subspace distinguishers: application to Whirlpool (Q2344049) (← links)
- On the security of RFID anti-counting security protocol (ACSP) (Q2349626) (← links)
- Collision analysis of one kind of chaos-based hash function (Q2429574) (← links)
- Quantum private comparison of equality protocol without a third party (Q2454194) (← links)
- On the collision and preimage security of MDC-4 in the ideal cipher model (Q2510658) (← links)
- Quantum collision attacks on AES-like hashing with low quantum random access memories (Q2692403) (← links)
- Improved collision detection of MD5 with additional sufficient conditions (Q2696718) (← links)