Theodoulos Garefalakis

According to our database, Theodoulos Garefalakis authored at least 20 papers between 1997 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Further Results on the Morgan-Mullen Conjecture.

Theodoulos Garefalakis, Giorgos Kapetanakis

Des. Codes Cryptogr., 2019

2017

On the multiplicative order of the roots of bX^{q^r+1} - aX^{q^r} - dX - c.

Fabio Enrique Brochero Martínez, Theodoulos Garefalakis, Lucas Reis, Eleni Tzanaki

Finite Fields Their Appl., 2017

Enumerating permutation polynomials.

Theodoulos Garefalakis, Giorgos Kapetanakis

Finite Fields Their Appl., 2017

2015

A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials.

Theodoulos Garefalakis, Giorgos Kapetanakis

Finite Fields Their Appl., 2015

2012

On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials.

Theodoulos Garefalakis, Giorgos Kapetanakis

Finite Fields Their Appl., 2012

Gauss periods as constructions of low complexity normal bases.

Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson

Des. Codes Cryptogr., 2012

2011

Self-reciprocal irreducible polynomials with prescribed coefficients.

Theodoulos Garefalakis

Finite Fields Their Appl., 2011

2010

A transform property of Kloosterman sums.

Ian F. Blake, Theodoulos Garefalakis

Discret. Appl. Math., 2010

2008

Irreducible polynomials with consecutive zero coefficients.

Theodoulos Garefalakis

Finite Fields Their Appl., 2008

Polynomial approximation of bilinear Diffie-Hellman maps.

Ian F. Blake, Theodoulos Garefalakis

Finite Fields Their Appl., 2008

The trace of an optimal normal element and low complexity normal bases.

Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson

Des. Codes Cryptogr., 2008

2006

On the bit security of the Diffie-Hellman key.

Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski

Appl. Algebra Eng. Commun. Comput., 2006

2004

The generalized Weil pairing and the discrete logarithm problem on elliptic curves.

Theodoulos Garefalakis

Theor. Comput. Sci., 2004

On the complexity of the discrete logarithm and Diffie-Hellman problems.

Ian F. Blake, Theodoulos Garefalakis

J. Complex., 2004

2002

Polynomials over finite fields free from large and small degree irreducible factors.

Theodoulos Garefalakis, Daniel Panario

J. Algorithms, 2002

On the Security of the Digital Signature Algorithm.

Ian F. Blake, Theodoulos Garefalakis

Des. Codes Cryptogr., 2002

Securing personal area networks.

Theodoulos Garefalakis, Christopher J. Mitchell

Proceedings of the 13th IEEE International Symposium on Personal, 2002

2001

The index calculus method using non-smooth polynomials.

Theodoulos Garefalakis, Daniel Panario

Math. Comput., 2001

2000

On the discrete logarithm problem in finite fields and on elliptic curves.

Theodoulos Garefalakis

PhD thesis, 2000

1997

A New Family of Randomized Algorithms for List Accessing.

Theodoulos Garefalakis

Proceedings of the Algorithms, 1997