5 citations · 5 across the 4 of their papers we have counts for
4 papers
Keyed hash function from large girth expander graphs
Eustrat Zhupa, Monika K. Polak
In this paper we present an algorithm to compute keyed hash function (message authentication code MAC). Our approach uses a family of expander graphs of large girth denoted $D(n,q)…
Graph based linear error correcting codes
Monika Polak, Eustrat Zhupa
In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDP…
The case for superelliptic curves
Tony Shaska, Eustrat Zhupa, Lubjana Beshaj
There is a natural question to ask whether the rich mathematical theory of the hyperelliptic curves can be extended to all superelliptic curves. Moreover, one wonders if all of the…
Classifying families of superelliptic curves
Rezart Muço, Nejme Pjero, Ervin Ruci +1
This paper is the first version of a project of classifying all superelliptic curves of genus according to their automorphism group. We determine the parametric equatio…