This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.

<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" aria-hidden="true" focusable="false" width="1em" height="1em" preserveAspectRatio="xMidYMid meet" viewBox="0 0 24 24" class="iconify mr-1" data-icon="mdi:arrow-left" style="vertical-align: -0.125em; transform: rotate(360deg);"><path d="M20 11v2H8l5.5 5.5l-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5L8 11h12z" fill="currentColor"></path></svg>~~NOTOC~~ ====== Jiří Gavenda ====== <ifauth @user> <callout type="primary" icon="true" title="Add your publications">If you have published anything not in the list, please add the bibliography entry to the list. Instructions can be found in the [[https://gitlab.fi.muni.cz/labak/wiki-publications|GitLab repository]]</callout> <callout type="success" icon="true" title="Don't forget submission table and author shares">Note down also the information on rejections and authorship percentages. We keep track of our lab efforts and author shares are useful for dissertation proposal/dissertation/habilitation/... There is a [[:internal:crocs:submissions|dedicated page where to write them]].</callout> </ifauth> ==== 2025==== * <text size="large">**CoolTest: Improved Randomness Testing Using Boolean Functions**</text>\\ [[:publications:authors:jiri-gavenda|Jiří Gavenda]] and [[:publications:authors:marek-sys|Marek Sýs]],\\ //ICT Systems Security and Privacy Protection//, Springer Nature Switzerland, 2025, 3--17.\\ ++ BibTeX |<code>@InProceedings{2025-ifipsec-gavenda, title = {CoolTest: Improved Randomness Testing Using Boolean Functions}, author = {Jiří Gavenda and Marek Sýs}, editor = {Nemec Zlatolas, Lili and Rannenberg, Kai and Welzer, Tatjana and Garcia-Alfaro, Joaquin}, booktitle = {ICT Systems Security and Privacy Protection}, year = {2025}, publisher = {Springer Nature Switzerland}, address = {Cham}, pages = {3--17}, abstract = {In this work, we present a new randomness test, CoolTest. CoolTest finds the optimal Boolean function from functions over k variables for distinguishing tested data from random. CoolTest generalizes and improves BoolTest (ICETE'17) as it can find an arbitrary correlation among k variables with comparable complexity, while BoolTest searches only for functions of a predefined form. CoolTest uses the innovative idea of Chatterjee et al. (INDOCRYPT'22), allowing to test {\$}{\$}2^{\{}2^k{\}}{\$}{\$}22kBoolean functions while evaluating only {\$}{\$}2^k{\$}{\$}2kof them. The test of Chatterjee et al. works only for rare cases when the correlated bits are close in the data. CoolTest makes the idea practically usable by selecting only a subset of bits on which it looks for a distinguisher.}, isbn = {978-3-031-92886-4}, } </code>++