1 citations · 2 across the 4 of their papers we have counts for
4 papers
Message Recovery Attack in NTRU via Knapsack
Eirini Poimenidou, K. A. Draziotis
In the present paper, we introduce a message-recovery attack based on the Modular Knapsack Problem, applicable to all variants of the NTRU-HPS cryptosystem. Assuming that a fractio…
Message Recovery Attack in NTRU through VFK Lattices
Eirini Poimenidou, Marios Adamoudis, Konstantinos A. Draziotis +1
In the present paper, we implement a message recovery attack to all variants of the NTRU cryptosystem. Our approach involves a reduction from the NTRU-lattice to a Voronoi First Ki…
Orbits of Hamiltonian Paths and Cycles in Complete Graphs
Samuel Herman, Eirini Poimenidou
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain dire…
A Method to Construct -Rotational Factorizations of Complete Graphs and Solutions to the Oberwolfach Problem
Daniel McGinnis, Eirini Poimenidou
The concept of a -rotational factorization of a complete graph under a finite group was studied in detail by Buratti and Rinaldi. They found that if admits a -rotatio…