Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes

DOI10.1007/978-3-319-44524-3_12zbMath1398.68379OpenAlexW2516521515MaRDI QIDQ1800680

Hirotoshi Takebe, Keisuke Tanaka, Akinori Kawachi

Publication date: 24 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-44524-3_12

zbMATH Keywords

non-malleability\(k\)-wise almost independent permutationsapproximate secrecysymmetric-key encryption schemes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) 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