Pages that link to "Item:Q2938857"
From MaRDI portal
The following pages link to Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE (Q2938857):
Displaying 12 items.
- Reflection ciphers (Q510444) (← links)
- PRINCEv2. More security for (almost) no overhead (Q832374) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem (Q2188960) (← links)
- Public key encryption with filtered equality test revisited (Q2232126) (← links)
- Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption (Q2402372) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- Key-Recovery Attacks Against the MAC Algorithm Chaskey (Q2807207) (← links)
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 (Q2835590) (← links)
- A New Algorithm for the Unbalanced Meet-in-the-Middle Problem (Q2958141) (← links)
- Bounds in Various Generalized Settings of the Discrete Logarithm Problem (Q6487216) (← links)
