Pavol Zajac

Has grant

slovak university of technology in bratislava
Country flagSlovakia

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Recent Grants

Grant: Open

Digitization, analysis, processing, and deciphering historical encrypted documents

Open Date: 2024-01-01

Close Date: 2027-12-31

Grant: Close

Postkvantová kryptografia odolná voči postranným kanálom

Open Date: 2023-01-01

Close Date: 2026-01-01

Grant: Close

Secure Communication via Classical and Quantum Technologies

Open Date: 2023-01-01

Close Date: 2026-01-01

Grant: Open

Side-channel resistant post-quantum cryptography

Open Date: 2023-01-01

Close Date: 2026-12-31

Grant: Close

Ontological representation for security of information systems

Open Date: 2020-07-01

Close Date: 2024-06-30

Articles (14)

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Cryptographic S-boxes are vectorial Boolean functions that must fulfill strict criteria to provide security for cryptographic algorithms. There are several existing methods for generating strong cryptographic S-boxes, including stochastic search algorithms. These search algorithms typically generate random candidate Boolean functions (or permutations) that are improved during the search by examining the search space in a specific way. Here, we introduce a new type of stochastic algorithm for generating cryptographic S-boxes. We do not generate and then improve the Boolean function; instead, we build the vector of values incrementally. New values are obtained by randomized search driven by restrictions on the differential spectrum of the generated S-box. In this article, we formulate two new algorithms based on this new approach and study the better one in greater detail. We prove the correctness of the proposed algorithm and evaluate its complexity. The final part contains an experimental evaluation of the method. We show that the algorithm generates S-boxes with better properties than a random search. We believe that our approach can be extended in the future by adopting more advanced stochastic search methods.

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Collaborators (1)

Eugen Antal

Associate professor

slovak university of technology in bratislava

SLOVAKIA
View details