Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
type: Item
instance of: scholarly article
title: Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
zbMATH Open document ID: 1398.68379
DOI: 10.1007/978-3-319-44524-3_12
author: Akinori Kawachi
author: Hirotoshi Takebe
author: Keisuke Tanaka
publication date: 2018-10-24T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6963922
zbMATH Keywords: \(k\)-wise almost independent permutations
zbMATH Keywords: symmetric-key encryption schemes
zbMATH Keywords: approximate secrecy
zbMATH Keywords: non-malleability
MaRDI profile type: Publication
full work available at URL: 978-3-319-44524-3 12
OpenAlex ID: W2516521515
Recommended article: Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
Recommended article: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
Recommended article: Lower bounds for the number of keys in a Zakrevskij cipher
Recommended article: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
Recommended article: Нижние оценки для практической секретности ключа
Recommended article: The Iterated Random Permutation Problem with Applications to Cascade Encryption
Recommended article: On the Indifferentiability of Key-Alternating Ciphers
Recommended article: New combinatorial bounds for authentication codes and key predistribution schemes
Recommended article: Estimation of the number of ``good'' permutations with applications to cryptography
Recommended article: An Upper Bound on the Key Equivocation for Pure Ciphers
description: scientific article; zbMATH DE number 6963922