Theodoulos Garefalakis

Publication Activity (10 Years)

Years Active: 1997-2019
Publications (10 Years): 4

Top Topics

Lower Complexity

Vlsi Architecture

Piecewise Polynomial

Top Venues

Finite Fields Their Appl.

Des. Codes Cryptogr.

Publications

Theodoulos Garefalakis, Giorgos Kapetanakis
Further Results on the Morgan-Mullen Conjecture. Des. Codes Cryptogr. 87 (11) (2019)
Theodoulos Garefalakis, Giorgos Kapetanakis
Enumerating permutation polynomials. Finite Fields Their Appl. 47 (2017)
Fabio Enrique Brochero Martínez, Theodoulos Garefalakis, Lucas Reis, Eleni Tzanaki
- dX - c. Finite Fields Their Appl. 47 (2017)
Theodoulos Garefalakis, Giorgos Kapetanakis
A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. Finite Fields Their Appl. 35 (2015)
Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson
Gauss periods as constructions of low complexity normal bases. Des. Codes Cryptogr. 62 (1) (2012)
Theodoulos Garefalakis, Giorgos Kapetanakis
On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. Finite Fields Their Appl. 18 (4) (2012)
Theodoulos Garefalakis
Self-reciprocal irreducible polynomials with prescribed coefficients. Finite Fields Their Appl. 17 (2) (2011)
Ian F. Blake, Theodoulos Garefalakis
A transform property of Kloosterman sums. Discret. Appl. Math. 158 (10) (2010)
Theodoulos Garefalakis
Irreducible polynomials with consecutive zero coefficients. Finite Fields Their Appl. 14 (1) (2008)
Ian F. Blake, Theodoulos Garefalakis
Polynomial approximation of bilinear Diffie-Hellman maps. Finite Fields Their Appl. 14 (2) (2008)
Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson
The trace of an optimal normal element and low complexity normal bases. Des. Codes Cryptogr. 49 (1-3) (2008)
Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski
On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16 (6) (2006)
Theodoulos Garefalakis
The generalized Weil pairing and the discrete logarithm problem on elliptic curves. Theor. Comput. Sci. 321 (1) (2004)
Ian F. Blake, Theodoulos Garefalakis
On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex. 20 (2-3) (2004)
Ian F. Blake, Theodoulos Garefalakis
On the Security of the Digital Signature Algorithm. Des. Codes Cryptogr. 26 (1-3) (2002)
Theodoulos Garefalakis, Daniel Panario
Polynomials over finite fields free from large and small degree irreducible factors. J. Algorithms 44 (1) (2002)
Theodoulos Garefalakis
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves. LATIN (2002)
Theodoulos Garefalakis, Christopher J. Mitchell
Securing personal area networks. PIMRC (2002)
Theodoulos Garefalakis, Daniel Panario
The index calculus method using non-smooth polynomials. Math. Comput. 70 (235) (2001)
Theodoulos Garefalakis
A New Family of Randomized Algorithms for List Accessing. ESA (1997)