most citedOn the Design of Chaos-Based S-boxes

40 citations · 61 across the 5 of their papers we have counts for

collaborators

7 papers

cs.IT20214 cited

On the Skew-Symmetric Binary Sequences and the Merit Factor Problem

Miroslav Dimitrov

The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory,…

eess.SP20211 cited

Hybrid Constructions of Binary Sequences with Low Autocorrelation Sidelobes

Miroslav Dimitrov, Tsonka Baitcheva, Nikolay Nikolov

In this work, a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), is revisited. By combining som…

cs.IT20214 cited

Some comments about CRC selection for the 5G NR specification

Tsonka Baicheva, Peter Kazakov, Miroslav Dimitrov

In this work the undetected error probability performance of the proposed in the technical specification of 5G new radio cyclic redundancy-check codes taking into consideration tha…

eess.SP202112 cited

On the Generation of Long Binary Sequences with Record-Breaking PSL Values

Miroslav Dimitrov, Tsonka Baitcheva, Nikolay Nikolov

Binary sequences are widely used in various practical fields, such as telecommunications, radar technology, navigation, cryptography, measurement sciences, biology or industry. In…

cs.CR2021

CUDA Tutorial -- Cryptanalysis of Classical Ciphers Using Modern GPUs and CUDA

Miroslav Dimitrov, Bernhard Esslinger

CUDA (formerly an abbreviation of Compute Unified Device Architecture) is a parallel computing platform and API model created by Nvidia allowing software developers to use a CUDA-e…

cs.CR202040 cited

On the Design of Chaos-Based S-boxes

Miroslav Dimitrov

Substitution boxes (S-boxes) are critical nonlinear elements to achieve cryptanalytic resistance of modern block and stream ciphers. Given their importance, a rich variety of S-box…