Related papers: Cryptanalysis of PLWE based on zero-trace quadrati…
Let $\mathbb{F}_q$ be a finite field with $q=p^e$ elements, where $p$ is a prime and $e\geq 1$ is an integer. Let $\ell<n$ be two positive integers. Fix a monic polynomial $u(x)=x^n +u_{n-1}x^{n-1}+\cdots +u_{\ell+1}x^{\ell+1} \in…
The POPLMARK Challenge comprises a set of problems intended to measure the strength of reasoning systems in the realm of mechanizing programming language meta-theory at the time the challenge was enunciated. Included in the collection is…
In the papers by Alvarez et al. and Pathak and Sanghi a non-commutative based public key exchange is described. A similiar version of it has also been patented (US7184551). In this paper we present a polynomial time attack that breaks the…
Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…
In 2019 G\'omez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme's design has a flaw which lets an attacker recover the…
We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that…
We apply the technique of twisted extensions of infinite-dimensional Lie algebras to find new 3D integrable {\sc pde}s related to the deformations of Lie algebra $\mathbb{R}_N[s]\otimes \mathfrak{w}$ with $N=1, 2$ as well as to the Lie…
We improve and simplify the result of the part 4 of "Counting curves and their projections" (Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski) by showing that counting roots of a sparse polynomial over $\mathbb{F}_{2^n}$ is #P- and…
We look at two classical examples in the theory of numerical analysis, namely the Runge example for interpolation and Wilkinson's example (actually two examples) for rootfinding. We use the modern theory of backward error analysis and…
We analyse the number of occurrences of a fixed non-zero digit in the width-w non-adjacent forms of all elements of a lattice in some region (e.g. a ball). Our result is an asymptotic formula, where its main term coincides with the full…
Consider a totally disconnected group G, which is covirtually cyclic, i.e., contains a normal compact open subgroup L such that G/L is infinite cyclic. We establish a Wang sequence, which computes the algebraic K-groups of the Hecke algebra…
Multidimensional signals like 2-D and 3-D images or videos are inherently sensitive signals which require privacy-preserving solutions when processed in untrustworthy environments, but their efficient encrypted processing is particularly…
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…
Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…
At CRYPTO 2017, Rosca, Sakzad, Stehle and Steinfeld introduced the Middle--Product LWE (MPLWE) assumption which is as secure as Polynomial-LWE for a large class of polynomials, making the corresponding cryptographic schemes more flexible in…
L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…