The idea is to apply a (1, s, v)-AONT to s plaintext blocks, where each plaintext block is treated as an element over an alphabet of size v. After the AONT is ...
Feb 21, 2017 · The main question we address in this paper is: for which choices of parameters does a (t, s, v)-all-or-nothing transform (AONT) exist? More ...
Dec 6, 2017 · The main question we address in this paper is: for which choices of parameters does a (t, s, v)-AONT exist? More specifically, if we fix t and v ...
We mainly concentrate on the case t = 2 for arbitrary values of v, where we obtain various necessary as well as sufficient conditions for existence of these ...
A $(t, s, v)$-all-or-nothing transform is a bijective mapping defined on $s$-tuples over an alphabet of size $v$, which satisfies the condition that the ...
Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson: Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IACR Cryptol.
All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These mappings are required to satisfy.
People also ask
Is the alphabet arbitrary?
Which alphabet became the basis for all other alphabets that were developed after it?
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IEEE Trans. Inform. Theory 64 (2018),. 3136–3143. [5] X. Wang, J. Cui ...
Mar 9, 2021 · All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These mappings are required ...
Missing: results existence arbitrary
Stinson, “Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets,” IEEE Transactions on Information Theory, vol. 64, no. 4 ...