Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sartaj Ul Hasan"'
Publikováno v:
Designs, Codes and Cryptography. 89:221-239
We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcd54c85e2d81b51241902a1cf79cc90
https://doi.org/10.1007/s10623-020-00812-0
https://doi.org/10.1007/s10623-020-00812-0
The book features original papers from International Conference on Cryptology & Network Security with Machine Learning (ICCNSML 2023), organized by PSIT, Kanpur, India during 27–29 October 2023. This conference proceeding provides the understanding
The article of record as published may be found at http://dx.doi.org/10.1109/TIT.2021.3123104 The Difference Distribution Table (DDT) and the differential uniformity play a major role for the design of substitution boxes in block ciphers, since they
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::148e3624a87713aae72b259a12e8180b
https://hdl.handle.net/10945/69145
https://hdl.handle.net/10945/69145
We consider the boomerang uniformity of an infinite class of (locally-APN) power maps and show that its boomerang uniformity over the finite field $\F_{2^n}$ is $2$ and $4$, when $n \equiv 0 \pmod 4$ and $n \equiv 2 \pmod 4$, respectively. As a conse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2882b14d871c1b5e4193db1315dc5333
The book features original papers from International Conference on Cryptology & Network Security with Machine Learning (ICCNSML 2022), organized by PSIT, Kanpur, India during 16 – 18 December 2022. This conference proceeding will provide the unders
Here, we give a complete description of the c-Boomerang Connectivity Table for the Gold function over finite fields of even characteristic, by using double Weil sums. In the process we generalize a result of Boura and Canteaut (IACR Trans. Symmetric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b464df3ea9fa241c4c03abfe8e22a6ae
Publikováno v:
Cryptography and Communications. 10:1075-1090
We discuss nonlinear vectorial primitive recursive sequences. First we consider the nonlinearly filtered multiple-recursive matrix generator for producing pseudorandom vectors based on some nonlinear schemes and give lower bounds for their componentw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18f1357231a166bf57c79924834a5e7f
https://doi.org/10.1007/s12095-017-0265-2
https://doi.org/10.1007/s12095-017-0265-2
We discuss the problem of classifying Dembowski-Ostrom polynomials from the composition of reversed Dickson polynomials of arbitrary kind and monomials over finite fields of odd characteristic. Moreover, by using a variant of the Weil bound for the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::061e0f6ffba12d7f43ae9222c871b48f
http://arxiv.org/abs/1905.01767
http://arxiv.org/abs/1905.01767
Publikováno v:
Linear Algebra and its Applications. 484:46-62
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short proof for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2514bc8a3b8b87244dae0eafedfe0217
https://doi.org/10.1016/j.laa.2015.06.020
https://doi.org/10.1016/j.laa.2015.06.020
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 finding an efficient primitive multiple-recursive matrix method. Moreover,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b93d416a1ee1bdf03dc4143bcb7f815b