Mohit Pal

dblp:263/4139 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2025
0000-0002-6464-7124ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 since 2021Theory of computation · 3 · 1 first-author · 3 since 2021
YearPublicationVenuePosition
2025 Arithmetization-oriented APN permutations
abstract
Abstract Recently, many cryptographic primitives such as homomorphic encryption (HE), multi-party computation (MPC) and zero-knowledge (ZK) protocols have been proposed in the literature which operate on the prime field $${\mathbb {F}}_p$$ F p for some large prime p. Primitives that are designed using such operations are called arithmetization-oriented primitives. As the concept of arithmetization-oriented primitives is new, a rigorous cryptanalysis of such primitives is yet to be done. In this paper, we investigate arithmetization-oriented APN functions. More precisely, we investigate APN permutations in the CCZ-classes of known families of APN power functions over the prime field $${\mathbb {F}}_p$$ F p . Moreover, we present a class of binomial permutation having differential uniformity at most 5 defined via the quadratic character over finite fields of odd characteristic. Computationally it is confirmed that the latter family contains new APN permutations for some small parameters. We conjecture it to contain an infinite subfamily of APN permutations.
Lilya Budaghyan, Mohit Pal
Des. Codes Cryptogr.2
2024 On Cryptographic Properties of a Class of Power Permutations in Odd Characteristic
Mohit Pal
WAIFI1
2022 The c-Differential Uniformity and Boomerang Uniformity of Two Classes of Permutation Polynomials
abstract
The Difference Distribution Table (DDT) and the differential uniformity play a major role for the design of substitution boxes in block ciphers, since they indicate the function’s resistance against differential cryptanalysis. This concept was extended recently to$c$-DDT and$c$-differential uniformity, which have the potential of extending differential cryptanalysis. Recently, a new theoretical tool, the Boomerang Connectivity Table (BCT) and the corresponding boomerang uniformity were introduced to quantify the resistance of a block cipher against boomerang-style attacks. Here we concentrate on two classes (introduced recently) of permutation polynomials over finite fields of even characteristic. For one of these, which is an involution used to construct a 4-uniform permutation, we explicitly determine the$c$-DDT entries and BCT entries. For the second type of function, which is a differentially 4-uniform function, we give bounds for its$c$-differential and boomerang uniformities.
Sartaj Ul Hasan, Mohit Pal, Pantelimon Stanica
IEEE Trans. Inf. Theory2
2021 Dembowski-Ostrom polynomials and reversed Dickson polynomials
Neranga Fernando, Sartaj Ul Hasan, Mohit Pal
Discret. Appl. Math.3
2021 On the c-differential uniformity of certain maps over finite fields
Sartaj Ul Hasan, Mohit Pal, Constanza Riera, Pantelimon Stanica
Des. Codes Cryptogr.2
2021 Boomerang uniformity of a class of power maps
Sartaj Ul Hasan, Mohit Pal, Pantelimon Stanica
Des. Codes Cryptogr.2