| |
| 2008 | ||
|---|---|---|
| 9 | EE | Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson: The trace of an optimal normal element and low complexity normal bases. Des. Codes Cryptography 49(1-3): 199-215 (2008) |
| 2006 | ||
| 8 | EE | Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski: On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) |
| 2004 | ||
| 7 | EE | Ian F. Blake, Theodoulos Garefalakis: On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complexity 20(2-3): 148-170 (2004) |
| 6 | EE | Theodoulos Garefalakis: The generalized Weil pairing and the discrete logarithm problem on elliptic curves. Theor. Comput. Sci. 321(1): 59-72 (2004) |
| 2002 | ||
| 5 | EE | Theodoulos Garefalakis: The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves. LATIN 2002: 118-130 |
| 4 | Ian F. Blake, Theodoulos Garefalakis: On the Security of the Digital Signature Algorithm. Des. Codes Cryptography 26(1-3): 87-96 (2002) | |
| 3 | EE | Theodoulos Garefalakis, Daniel Panario: Polynomials over finite fields free from large and small degree irreducible factors. J. Algorithms 44(1): 98-120 (2002) |
| 2001 | ||
| 2 | Theodoulos Garefalakis, Daniel Panario: The index calculus method using non-smooth polynomials. Math. Comput. 70(235): 1253-1264 (2001) | |
| 1997 | ||
| 1 | Theodoulos Garefalakis: A New Family of Randomized Algorithms for List Accessing. ESA 1997: 200-216 | |
| 1 | Ian F. Blake | [4] [7] [8] |
| 2 | Maria Christopoulou | [9] |
| 3 | Daniel Panario | [2] [3] [9] |
| 4 | Igor Shparlinski | [8] |
| 5 | David Thomson | [9] |