Related papers: Constructing Permutation Rational Functions From I…
We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny…
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…
The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
This paper presents a description and analysis of a rational cubic spline FIF (RCSFIF) that has two shape parameters in each subinterval when it is defined implicitly. To be precise, we consider the iterated function system (IFS) with…
A smooth Hermitian surface $X$ is a projective surface isomorphic to the Fermat surface of degree $q+1$ in positive characteristic. We study incidence relations of the rational curves of degree $q+1$ contained in $X$, and show that such…
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…
This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…
Let $E$ be an ordinary elliptic curve over a finite field and $g$ be a positive integer. Under some technical assumptions, we give an algorithm to span the isomorphism classes of principally polarized abelian varieties in the isogeny class…
Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…
We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
For a rational function of several variables with nonnegative imaginary part on the upper poly-half-plane, the matrix representations are obtained.
Greene's rational function $\Psi_P({\bf x})$ is a sum of certain rational functions in ${\bf x}=(x_1, \ldots, x_n)$ over the linear extensions of the poset $P$ (which has $n$ elements), which he introduced in his study of the…
Recently Lima and Campello de Souza introduced a new class of rational functions over odd-order finite fields, and explained their potential usefulness in cryptography. We show that these new functions are conjugate to the classical family…
Let $A$ be a rational function. For any decomposition of $A$ into a composition of rational functions $A=U\circ V$ the rational function $\widetilde A=V\circ U$ is called an elementary transformation of $A$, and rational functions $A$ and…