Original scientific paper

Constructions for uniform (m,3)-splitting systems

Dongyoung Roh ; Attached Institute of Electronics and Telecommunications Research Institute, Daejeon, Republic of Korea
Sang Geun Hahn ; Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea

Abstract

Suppose $m$ and $t$ are integers such that $0 < t \leq m$. An
$(m,t)$-splitting system is a pair $(X, \Bbb{B})$, where $|X|=m$
and $\Bbb{B}$ is a set of subsets of $X$, called blocks, such
that for every $Y \subseteq X$ and $|Y|=t$, there exists a block $B
\in \Bbb{B}$ such that $|B \cap Y| = \lfloor t/2 \rfloor$. An
$(m,t)$-splitting system is uniform if every block has size $\lfloor
m/2 \rfloor$.
We present new construction methods of uniform splitting systems for $t=3$ that have a smaller number of blocks as compared to previous results.

Keywords

splitting systems; baby-step giant-step algorithms; low Hamming weight discrete logarithm problem

Hrčak ID:

93297

URI

https://hrcak.srce.hr/93297

Publication date:

5.12.2012.

Visits: 1.062 *