Related papers: Giesbrecht's algorithm, the HFE cryptosystem and O…
Hidden shift problems are relevant to assess the quantum security of various cryptographic constructs. Multiple quantum subexponential time algorithms have been proposed. In this paper, we propose some improvements on a polynomial quantum…
We find a local $(d+1) \times (d+1)$ Riemann-Hilbert problem characterizing the skew-orthogonal polynomials associated to the partition function of the Gaussian Orthogonal Ensemble of random matrices with a potential function of degree $d$.…
We give two algorithms for computing the Hilbert depth of a \emph{graded ideal} in the polynomial ring. These algorithms work efficiently for (squarefree) lex ideals. As a consequence, we construct counterexamples to some conjectures made…
This paper introduces a new generalized polynomial chaos expansion (PCE) comprising multivariate Hermite orthogonal polynomials in dependent Gaussian random variables. The second-moment properties of Hermite polynomials reveal a weakly…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
Bergman's Ring $E_p$, parameterized by a prime number $p$, is a ring with $p^5$ elements that cannot be embedded in a ring of matrices over any commutative ring. This ring was discovered in 1974. In 2011, Climent, Navarro and Tortosa…
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of…
We derive a family of high-order, structure-preserving approximations of the Riemannian exponential map on several matrix manifolds, including the group of unitary matrices, the Grassmannian manifold, and the Stiefel manifold. Our…
The concept of Public- key cryptosystem was innovated by McEliece's cryptosystem. The public key cryptosystem based on rank codes was presented in 1991 by Gabidulin -Paramonov-Trejtakov(GPT). The use of rank codes in cryptographic…
In this letter, we delve into a scenario where a user aims to compute polynomial functions using their own data as well as data obtained from distributed sources. To accomplish this, the user enlists the assistance of $N$ distributed…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…
This paper presents a novel reversible data hiding (RDH) algorithm for gray-scaled images, in which the prediction-error of prediction error (PPE) of a pixel is used to carry the secret data. In the proposed method, the pixels to be…
We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…
Let $p(t)$ be an admissible Hilbert polynomial in $\PP^n$ of degree $d$. The Hilbert scheme $\hilb^n_p(t)$ can be realized as a closed subscheme of a suitable Grassmannian $ \mathbb G$, hence it could be globally defined by homogeneous…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting…