activity
20052026
most citedOn the c-differential uniformity of certain maps over finite fields

41 citations · 99 across the 27 of their papers we have counts for

collaborators

30 papers

cs.IT2026

Differential-linear profiles over finite fields of arbitrary characteristic

Kirpa Garg, Constanza Riera, Pantelimon Stănică

The (binary) differential-linear connectivity table (DLCT) measures the dependence between an input difference and a linear mask applied to the corresponding output difference. For…

math.NT2026

Overconstrained character sums over finite abelian groups and decompositions of generalized bent, plateaued and landscape functions

Ayça Çeşmelioğlu, Constanza Riera, Pantelimon Stănică

Generalized bent (gbent) functions from an -variable Boolean space to are central in cryptography and sequence design. Instead of the usual binary decompositi…

cs.CR2024★ 1 cited

The revised boomerang connectivity tables and their connection to the Difference Distribution Table

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera +1

It is well-known that functions over finite fields play a crucial role in designing substitution boxes (S-boxes) in modern block ciphers. In order to analyze the security of an S-b…

cs.IT2023★ 3 cited

The second-order zero differential spectra of some APN and other maps over finite fields

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera +1

The Feistel Boomerang Connectivity Table and the related notion of -Boomerang uniformity (also known as the second-order zero differential uniformity) has been recently introduc…

cs.IT2023★ 4 cited

The second-order zero differential spectra of some functions over finite fields

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera +1

It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the -boomerang uniformity (which is the same as the second-order zero differential unif…

cs.IT2022★ 1 cited

PN functions, complete mappings and quasigroup difference sets

Nurdagul Anbar, Tekgul Kalyci, Wilfried Meidl +2

We investigate pairs of permutations of such that is a permutation for every . We show that necessarily $G(x) = \wp(F(x…