arXiv subjects

Rebeka Kiss

Publications and source records attributed to Rebeka Kiss.

3 recordsLinked to original sources

arXiv2026

The IRT Telescope on board the THESEUS mission

We present the Infra-Red Telescope (IRT), which is part of the payload of the THESEUS mission, one on the three phase A candidate missions for the M7 slot of ESA (launch date 2037). The IRT is a 0.7 m class telescope with an off-axis Korsch optical design, with imaging capabilities in the 0.7-1.8 microns range over a 15 x 15 arc min field of view. The IRT also provides slit-less low resolution spectroscopy (R~400) over a limited field of view of 2 x 2 arc min, in the 0.8-1.6 microns range. The goal of the IRT is to identify the near infrared counterparts to the Gamma-Ray Bursts (GRBs) detected by the two other telescopes on board THESEUS (the XGIS and the SXI), and to measure on board its photometric redshift in near real-time. The position and the redshift will be transmitted immediately to ground to allow for deeper follow-up by the large telescopes (ELT, VLT, ...). If the source is bright enough, spectroscopy will be performed to characterize the GRB environment.

astro-ph.IM↗

arXiv2022

Simplicity conditions for binary orthogonal arrays

It is known that correlation-immune (CI) Boolean functions used in the framework of side-channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays when their elements are written as rows of an array. The minimum Hamming weight of a CI function is then the same as the minimum number of rows in a simple orthogonal array. In this paper, we use Rao's Bound to give a sufficient condition on the number of rows, for a binary orthogonal array (OA) to be simple. We apply this result for determining the minimum number of rows in all simple binary orthogonal arrays of strengths 2 and 3; we show that this minimum is the same in such case as for all OA, and we extend this observation to some OA of strengths $4$ and $5$. This allows us to reply positively, in the case of strengths 2 and 3, to a question raised by the first author and X. Chen on the monotonicity of the minimum Hamming weight of 2-CI Boolean functions, and to partially reply positively to the same question in the case of strengths 4 and 5.

math.CO↗

arXiv2020

On the nonexistence of certain orthogonal arrays of strength four

We show that no orthogonal arrays $OA(16 λ, 11, 2,4)$ exist with $λ=6$ and $λ=7$. This solves an open problem of the NSUCRYPTO Olympiad 2018. Our result allows us to determine the minimum weights of certain higher-order correlation-immune Boolean functions.

math.CO↗