1 citations · 1 across the 8 of their papers we have counts for
9 papers
Constructions of complete permutations over
Sartaj Ul Hasan, Ramandeep Kaur, Hridesh Kumar +2
Complete permutation polynomials play an important role in cryptography, particularly in the design of cryptographic primitives such as the Lai--Massey scheme and S-boxes. We gener…
On the Dynamics of Linear Finite Dynamical Systems Over Galois Rings
Jonas Kantic, Claudio Qureshi, Daniel Panario +1
Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the…
The complexity of elliptic normal bases
Daniel Panario, Mohamadou Sall, Qiang Wang
We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexit…
Infinitude of palindromic almost-prime numbers
Aleksandr Tuxanidy, Daniel Panario
It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution est…
A Construction of Permutation Polynomials Using Rédei Function in Even Characteristic
Daniel Panario, Nihal Uyar, Qiang Wang
The Rédei function defined over a field of even characteristic has been introduced by Nöbauer in 1986 \cite{even}. In this paper, inspired by the work of Fu et al. \cite{wang} in o…
Functional graphs of generalized cyclotomic mappings of finite fields
Alexander Bors, Daniel Panario, Qiang Wang
The functional graph of a function is the directed graph with vertex set the edges of which are of the form for . Functional grap…
Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects
Claude Gravel, Daniel Panario
Let and be the random variable representing the size of the smallest component of a random combinatorial object made of elements. A combinatorial object could…
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces
André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura +2
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product…
Comparing balanced -sequences obtained from ElGamal function to random balanced sequences
Daniel Panario, Lucas Pandolfo Perin, Brett Stevens
In this paper, we investigate the randomness properties of sequences in derived from permutations in using the remainder function modulo , wher…