collaborators

14 papers

cs.CR2026

A Post-Quantum Secure Lattice-Based Forward-Secure Identity Based Encryption with Applications to Internet of Things Architecture

Abhishek Kumar, Vikas Srivastava, Sumit Kumar Debnath +1

The rapid expansion of the Internet of Things (IoT) has led to an unprecedented scale of data exchange across heterogeneous and resource-constrained devices. Ensuring confidentiali…

cs.IT2026

On the hull of linearized polynomial codes

Daniele Bartoli, Giovanni Giuseppe Grimaldi, Pantelimon Stănică

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two fami…

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…

math.NT2026

Infinite families of APN permutations in constrained trivariate classes over

Daniele Bartoli, Pantelimon Stanica

We study trivariate permutation polynomials over extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scal…

cs.IT2026

Permutation Polynomials Under Multiplicative-Additive Perturbations: Characterization via Difference Distribution Tables

Ranit Dutta, Pantelimon Stanica, Bimal Mandal

We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. Th…

math.NT2026

On the Classification of Dillon's APN Hexanomials

Daniele Bartoli, Giovanni Giuseppe Grimaldi, Pantelimon Stanica

We systematically analyze a class of hexanomial functions over finite fields of characteristic proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functi…