41 citations · 141 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
Permutation polynomials over finite fields from low-degree rational functions
Kirpa Garg, Sartaj Ul Hasan, Chunlei Li +2
This paper considers permutation polynomials over the finite field in even characteristic by utilizing low-degree permutation rational functions over . As a result,…
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…
A note on the multiple-recursive matrix method for generating pseudorandom vectors
Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan
The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for find…