Zobrazeno 1 - 10
of 417
pro vyhledávání: '"Panario Daniel"'
Autor:
Gravel Claude, Panario Daniel
Publikováno v:
Journal of Mathematical Cryptology, Vol 18, Iss 1, Pp 2350051-715 (2024)
The authors introduced a new family of cryptographic schemes in a previous research article, which includes many practical encryption schemes, such as the Feistel family. Given a finite field of order qq, any n>m≥0n\gt m\ge 0, the authors described
Externí odkaz:
https://doaj.org/article/55fb642de4414294b9dba720462348bc
For each positive integer $n$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of the finite field $\mathbb F_q$ with $q$ elements, where $q$ is a prime power. It is known that for arbitrary $q$ and $n$, there exists an element $\beta\in \ma
Externí odkaz:
http://arxiv.org/abs/2412.15384
This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional cyclic code
Externí odkaz:
http://arxiv.org/abs/2412.13616
This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both matrix and
Externí odkaz:
http://arxiv.org/abs/2412.13613
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 complexity of these elliptic normal bases, and we analyze the weight of some sp
Externí odkaz:
http://arxiv.org/abs/2401.11872
Autor:
Tuxanidy, Aleksandr, Panario, Daniel
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 estimates for the palindromes in residue classes to large moduli, offerin
Externí odkaz:
http://arxiv.org/abs/2307.16637
The R\'{e}dei function defined over a field of even characteristic has been introduced by N\"{o}bauer in 1986 \cite{even}. In this paper, inspired by the work of Fu et al. \cite{wang} in odd characteristic, employing the AGW criterion \cite{agw}, we
Externí odkaz:
http://arxiv.org/abs/2305.03521
The functional graph of a function $g:X\rightarrow X$ is the directed graph with vertex set $X$ the edges of which are of the form $x\rightarrow g(x)$ for $x\in X$. Functional graphs are heavily studied because they allow one to understand the behavi
Externí odkaz:
http://arxiv.org/abs/2304.00181
Autor:
Gravel, Claude, Panario, Daniel
Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a surjectiv
Externí odkaz:
http://arxiv.org/abs/2212.12847
Publikováno v:
Information Processing Letters 115 (2015) 731-737
We consider the problem of detecting and locating modifications in signed data to ensure partial data integrity. We assume that the data is divided into $n$ blocks (not necessarily of the same size) and that a threshold $d$ is given for the maximum a
Externí odkaz:
http://arxiv.org/abs/2208.01411