The following pages link to (Q4341758):
Displaying 22 items.
- Attacks on quantum key distribution protocols that employ non-ITS authentication (Q265393) (← links)
- A new multi-linear universal hash family (Q369419) (← links)
- Direct proof of security of Wegman-Carter authentication with partially known key (Q479440) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Universal hashing and authentication codes (Q1335421) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- A coding theory construction of new systematic authentication codes (Q1763702) (← links)
- The circulant hash revisited (Q2033521) (← links)
- Tight security bounds for double-block hash-then-sum MACs (Q2055619) (← links)
- Quantum key distribution using universal hash functions over finite fields (Q2107057) (← links)
- Some constructions of systematic authentication codes using Galois rings (Q2383975) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- A trade-off between collision probability and key size in universal hashing using polynomials (Q2430412) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Коды аутентификации с секретностью (обзор) (Q3381884) (← links)
- Universal Hashing and Multiple Authentication (Q3452336) (← links)
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings (Q3452337) (← links)
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms (Q3600218) (← links)
- Key Agreement from Close Secrets over Unsecured Channels (Q3627436) (← links)
- (Q4487082) (← links)
- Fast message authentication using efficient polynomial evaluation (Q4639340) (← links)
- On Efficient Message Authentication Via Block Cipher Design Techniques (Q5387102) (← links)
