Szabolcs Tengely

activity

20052023

x^{2} + q^{2 m} = 2 y^{p}

13 citations · 26 across the 15 of their papers we have counts for

collaborators

18 papers

math.NT2023

Singmaster-type results for Stirling numbers and some related diophantine equations

András Bazsó, István Mező, {Á}kos Pintér +1

Motivated by the work of David Singmaster, we study the number of times an integer can appear among the Stirling numbers of both kinds. We provide an upper bound for the occurrence…

math.NT2021

Equal values of certain partition functions via Diophantine equations

Szabolcs Tengely, Maciej Ulas

Let $A \subset N_{+}$ and by $P_{A} (n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$ . The aim of this paper is to prove several result concerning…

math.CO2020

Discrete logarithm problem in some families of sandpile groups

Krisztián Dsupin, Szabolcs Tengely

Biggs proposed the sandpile group of certain modified wheel graphs for cryptosystems relying on the difficulty of the discrete logarithm problem. Blackburn and independently Shokri…

math.NT2020★ 1 cited

On a Diophantine equation of Erdős and Graham

Szabolcs Tengely, Maciej Ulas, Jakub Zygadło

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1}, \dots, a_{k}$ sa…

math.NT2020

Markoff-Rosenberger triples and generalized Lucas sequences

Hayder Hashim, László Szalay, Szabolcs Tengely

We consider the Markoff-Rosenberger equation $a x^{2} + b y^{2} + c z^{2} = d x y z$ with $(x, y, z) = (U_{i}, U_{j}, U_{k}),$ where $U_{i}$ denotes the $i$ -th generalized Lucas number of first/second kind. We…

cs.CR2020

Cryptanalysis of ITRU

Hashim H. R., Molnár A., Tengely Sz

ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on…