Lower bounds for key length of k-wise almost independent permutations and certain symmetric-key encryption schemes
DOI10.1007/978-3-319-44524-3_12zbMATH Open1398.68379OpenAlexW2516521515MaRDI QIDQ1800680FDOQ1800680
Authors: Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka 
Publication date: 24 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-44524-3_12
Recommendations
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Lower bounds for the number of keys in a Zakrevskij cipher
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Нижние оценки для практической секретности ключа
- The iterated random permutation problem with applications to cascade encryption
- On the indifferentiability of key-alternating ciphers
- New combinatorial bounds for authentication codes and key predistribution schemes
- Estimation of the number of ``good permutations with applications to cryptography
- An Upper Bound on the Key Equivocation for Pure Ciphers
non-malleability\(k\)-wise almost independent permutationsapproximate secrecysymmetric-key encryption schemes
Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Cryptography (94A60)
This page was built for publication: Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800680)
