The following pages link to (Q4940708):
Displayed 36 items.
- On modes of operations of a block cipher for authentication and authenticated encryption (Q301626) (← links)
- CBCR: CBC MAC with rotating transformations (Q350985) (← links)
- TrCBC: another look at CBC-MAC (Q413314) (← links)
- Security of message authentication codes in the presence of key-dependent messages (Q420612) (← links)
- Multi-verifier signatures (Q431790) (← links)
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
- On the optimality of non-linear computations for symmetric key primitives (Q1755961) (← links)
- On-line ciphers and the Hash-CBC constructions (Q1928770) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- On tight quantum security of HMAC and NMAC in the quantum random oracle model (Q2120095) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← links)
- One-Key Compression Function Based MAC with Security Beyond Birthday Bound (Q2817474) (← links)
- PMAC with Parity: Minimizing the Query-Length Influence (Q2890005) (← links)
- PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers (Q3092364) (← links)
- How much data may be safely processed on one key in different modes? (Q3383073) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- Authenticated Encryption Mode for Beyond the Birthday Bound Security (Q3506375) (← links)
- On the Unprovable Security of 2-Key XCBC (Q3511165) (← links)
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier (Q3525682) (← links)
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms (Q3600218) (← links)
- MMH: Software message authentication in the Gbit/second rates (Q4639339) (← links)
- Fast message authentication using efficient polynomial evaluation (Q4639340) (← links)
- A MAC Mode for Lightweight Block Ciphers (Q4639470) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- ON THE SECURITY OF AEAD-CRYPTOSYSTEM OF THE GCM TYPE (Q5150736) (← links)
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound (Q5452269) (← links)
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs (Q5458593) (← links)
- The security of the cipher block chaining message authentication code (Q5929912) (← links)
- Multi-user security of the sum of truncated random permutations (Q6132432) (← links)
- Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC} (Q6135403) (← links)
- Improved multi-user security using the squared-ratio method (Q6145930) (← links)
- Fine-tuning the ISO/IEC standard \textsf{LightMAC} (Q6157560) (← links)
- Improved truncated differential distinguishers of AES with concrete S-box (Q6169479) (← links)
- Universal hashing based on field multiplication and (near-)MDS matrices (Q6186343) (← links)
- On the security of keyed hashing based on public permutations (Q6186773) (← links)
- Revisiting the indifferentiability of the sum of permutations (Q6186774) (← links)