2 citations · 2 across the 5 of their papers we have counts for
6 papers
Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
M. Adamoudis, K. A. Draziotis, D. Poulakis
In this paper, we present a deterministic attack on (EC)DSA signature scheme, providing that several signatures are known such that the corresponding ephemeral keys share a certain…
Complex Roots of Quaternion Polynomials
Petroula Dospra, Dimitrios Poulakis
The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number …
Thue equations and CM-fields
Yves Aubry, Dimitrios Poulakis
We obtain a polynomial type upper bound for the size of the integral solutions of Thue equations defined over a totally real number field , assuming that h…
A Digital Signature Scheme for Long-Term Security
Dimitrios Poulakis, Robert Rolland
In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It i…
An Effective Version of Chevalley-Weil Theorem for Projective Plane Curves
Konstantinos Draziotis, Dimitrios Poulakis
We obtain a quantitative version of the classical Chevalley-Weil theorem for curves. Let be an unramified morphism of non-singular plane projective curves defi…
Efficient algorithms for the basis of finite Abelian groups
Gregory Karagiorgos, Dimitrios Poulakis
Let be a finite abelian group with elements. In this paper we give a O(N) time algorithm for computing a basis of . Furthermore, we obtain an algorithm for computing…