Public key infrastructure in mobile systems J Dankers, T Garefalakis, R Schaffelhofer, T Wright Electronics & Communication engineering journal 14 (5), 180-190, 2002 | 74 | 2002 |

The trace of an optimal normal element and low complexity normal bases M Christopoulou, T Garefalakis, D Panario, D Thomson Designs, Codes and Cryptography 49 (1-3), 199-215, 2008 | 26 | 2008 |

Gauss periods as constructions of low complexity normal bases M Christopoulou, T Garefalakis, D Panario, D Thomson Designs, Codes and Cryptography 62 (1), 43-62, 2012 | 23 | 2012 |

On the action of GL2 (Fq) on irreducible polynomials over Fq T Garefalakis Journal of Pure and Applied Algebra 215 (8), 1835-1843, 2011 | 20 | 2011 |

On the complexity of the discrete logarithm and Diffie–Hellman problems IF Blake, T Garefalakis Journal of Complexity 20 (2-3), 148-170, 2004 | 20 | 2004 |

Irreducible polynomials with consecutive zero coefficients T Garefalakis Finite Fields and Their Applications 14 (1), 201-208, 2008 | 17 | 2008 |

On the security of the digital signature algorithm IF Blake, T Garefalakis Designs, Codes and Cryptography 26 (1-3), 87-96, 2002 | 16 | 2002 |

The index calculus method using non-smooth polynomials T Garefalakis, D Panario Mathematics of Computation 70 (235), 1253-1264, 2001 | 15 | 2001 |

Securing personal area networks T Garefalakis, CJ Mitchell The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio …, 2002 | 11 | 2002 |

On the bit security of the Diffie-Hellman key IF Blake, T Garefalakis, IE Shparlinski Applicable Algebra in Engineering, Communication and Computing 16 (6), 397-404, 2006 | 10 | 2006 |

On the bit security of the Diffie-Hellman key IF Blake, T Garefalakis, IE Shparlinski Applicable Algebra in Engineering, Communication and Computing 16 (6), 397-404, 2006 | 10 | 2006 |

Polynomials over finite fields free from large and small degree irreducible factors T Garefalakis, D Panario Journal of Algorithms 44 (1), 98-120, 2002 | 10 | 2002 |

On the Hansen–Mullen conjecture for self-reciprocal irreducible polynomials T Garefalakis, G Kapetanakis Finite Fields and Their Applications 18 (4), 832-841, 2012 | 8 | 2012 |

Self-reciprocal irreducible polynomials with prescribed coefficients T Garefalakis Finite Fields and Their Applications 17 (2), 183-193, 2011 | 7 | 2011 |

PKI in mobile systems J Dankers, T Garefalakis, R Schaffelhofer, T Wright IEE TELECOMMUNICATIONS SERIES 51, 11-32, 2004 | 7 | 2004 |

The generalized Weil pairing and the discrete logarithm problem on elliptic curves T Garefalakis Theoretical computer science 321 (1), 59-72, 2004 | 6 | 2004 |

The generalized Weil pairing and the discrete logarithm problem on elliptic curves T Garefalakis Latin American Symposium on Theoretical Informatics, 118-130, 2002 | 6 | 2002 |

On the existence of primitive completely normal bases of finite fields T Garefalakis, G Kapetanakis Journal of Pure and Applied Algebra 223 (3), 909-921, 2019 | 5 | 2019 |

A new family of randomized algorithms for list accessing T Garefalakis European Symposium on Algorithms, 200-216, 1997 | 5 | 1997 |

A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. T Garefalakis, G Kapetanakis Finite Fields Their Appl. 35, 61-63, 2015 | 4 | 2015 |