The summation-truncation hybrid: reusing discarded bits for free
From MaRDI portal
Publication:2096483
DOI10.1007/978-3-030-56784-2_7zbMath1503.94030OpenAlexW3048662861MaRDI QIDQ2096483
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_7
Related Items (3)
\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Multi-user security of the sum of truncated random permutations ⋮ Luby-Rackoff backwards with more users and more security
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- EUROCRYPT 2006. 25th annual international conference on the theory and applications of cryptographic techniques, St. Petersburg, Russia, May 28 -- June 1, 2006. Proceedings.
- New hash functions and their use in authentication and set equality
- How to stretch random functions: The security of protected counter sums
- Optimal forgeries against polynomial-based MACs and GCM
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part I
- How many queries are needed to distinguish a truncated random permutation from a random function?
- A note on the chi-square method: a tool for proving cryptographic security
- Linking Stam's bounds with generalized truncation
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- KLEIN: A New Family of Lightweight Block Ciphers
- Breaking and Repairing GCM Security Proofs
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- LBlock: A Lightweight Block Cipher
- Piccolo: An Ultra-Lightweight Blockcipher
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- HIGHT: A New Block Cipher Suitable for Low-Resource Device
- PRESENT: An Ultra-Lightweight Block Cipher
- A Provable-Security Treatment of the Key-Wrap Problem
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- A NOTE ON SAMPLING WITH AND WITHOUT REPLACEMENT
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Distance between sampling with and without replacement
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: The summation-truncation hybrid: reusing discarded bits for free
