Welcome to the resource topic for 2020/715
Title:
On (impracticality of) transfinite symmetric encryption with keys smaller than messages under GCH
Authors: Sergij V. Goncharov
Abstract:In this short trivial note we argue that, assuming Generalized Continuum Hypothesis to be true, it is impractical to use encryption with Key \in \{ 0, 1 \}^K and Message \in \{ 0, 1 \}^M such that \aleph_0 \leqslant \mathrm{card}\,K < \mathrm{card}\,M, because “complexity” of the known-plaintext bruteforce attack equals “complexity” of a single En/Decrypt(Key, Message) “computation” then.
ePrint: https://eprint.iacr.org/2020/715
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .