Sergey Kandiy
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
Articles (4)
Year:
2025
Year:
2025
Year:
2025
In the realm of smart communication systems, where the ubiquity of 5G/6G networks and IoT applications demands robust data confidentiality, the cryptographic integrity of block and stream cipher mechanisms plays a pivotal role. This paper focuses on the enhancement of cryptographic strength in these systems through an innovative approach to generating substitution boxes (S-boxes), which are integral in achieving confusion and diffusion properties in substitution–permutation networks. These properties are critical in thwarting statistical, differential, linear, and other forms of cryptanalysis, and are equally vital in pseudorandom number generation and cryptographic hashing algorithms. The paper addresses the challenge of rapidly producing random S-boxes with desired cryptographic attributes, a task notably arduous given the complexity of existing generation algorithms. We delve into the hill climbing algorithm, exploring various cost functions and their impact on computational complexity for generating S-boxes with a target nonlinearity of 104. Our contribution lies in proposing a new cost function that markedly reduces the generation complexity, bringing down the iteration count to under 50,000 for achieving the desired S-box. This advancement is particularly significant in the context of smart communication environments, where the balance between security and performance is paramount.
Year:
2024
Collaborators (3)
Natalia Kryvinska
Comenius University in Bratislava
Michal Gregus
Assoc.Professor
Comenius University in Bratislava
Emanuele Frontoni
Full Professor of Computer Science
University of Macerata
Make your next move.
Prepare your application
Review drafts before you send them.