The summation-truncation hybrid: reusing discarded bits for free
type: Item
instance of: scholarly article
title: The summation-truncation hybrid: reusing discarded bits for free
zbMATH Open document ID: 1503.94030
DOI: 10.1007/978-3-030-56784-2_7
author: Aldo Gunsing
author: Bart Mennink
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 7614539
zbMATH Keywords: PRP-to-PRF
zbMATH Keywords: truncation
zbMATH Keywords: sum of permutations
zbMATH Keywords: efficiency
zbMATH Keywords: GCM-SIV
describes a project that uses: PRESENT
describes a project that uses: HIGHT
describes a project that uses: PRINCE
describes a project that uses: SIMECK
describes a project that uses: KATAN
describes a project that uses: KLEIN
describes a project that uses: Piccolo
describes a project that uses: SKINNY
describes a project that uses: mCrypton
describes a project that uses: LBlock
describes a project that uses: SIMON
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 7
OpenAlex ID: W3048662861
cites work: The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
cites work: The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
cites work: Q4343418
cites work: Q4940708
cites work: Q4249643
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: How to stretch random functions: The security of protected counter sums
cites work: Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
cites work: A note on the chi-square method: a tool for proving cryptographic security
cites work: PRESENT: An Ultra-Lightweight Block Cipher
cites work: PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
cites work: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
cites work: EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
cites work: Q2760977
cites work: Information-theoretic indistinguishability via the chi-squared method
cites work: KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
cites work: How many queries are needed to distinguish a truncated random permutation from a random function?
cites work: KLEIN: A New Family of Lightweight Block Ciphers
cites work: Q4249345
cites work: HIGHT: A New Block Cipher Suitable for Low-Resource Device
cites work: Q5750403
cites work: New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
cites work: Breaking and Repairing GCM Security Proofs
cites work: Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Q3374930
cites work: Optimal forgeries against polynomial-based MACs and GCM
cites work: Progress in Cryptology - INDOCRYPT 2004
cites work: Linking Stam's bounds with generalized truncation
cites work: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
cites work: Q1745581
cites work: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
cites work: A Provable-Security Treatment of the Key-Wrap Problem
cites work: Piccolo: An Ultra-Lightweight Blockcipher
cites work: On Fast and Provably Secure Message Authentication Based on Universal Hashing
cites work: Distance between sampling with and without replacement
cites work: A NOTE ON SAMPLING WITH AND WITHOUT REPLACEMENT
cites work: 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.
cites work: New hash functions and their use in authentication and set equality
cites work: LBlock: A Lightweight Block Cipher
description: scientific article; zbMATH DE number 7614539