Theodoulos Garefalakis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2019

Further Results on the Morgan-Mullen ConjectureTheodoulos Garefalakis, Giorgos Kapetanakis. dcc, 87(11):2639-2654, 2019. [doi]

2017

Enumerating permutation polynomialsTheodoulos Garefalakis, Giorgos Kapetanakis. ffa, 47:85-93, 2017. [doi]

r - dX - cF. E. Brochero Martínez, Theodoulos Garefalakis, Lucas Reis, Eleni Tzanaki. ffa, 47:33-45, 2017. [doi]

2015

A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomialsTheodoulos Garefalakis, Giorgos Kapetanakis. ffa, 35:61-63, 2015. [doi]

2012

Gauss periods as constructions of low complexity normal basesMaria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson. dcc, 62(1):43-62, 2012. [doi]

On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomialsTheodoulos Garefalakis, Giorgos Kapetanakis. ffa, 18(4):832-841, 2012. [doi]

2011

Self-reciprocal irreducible polynomials with prescribed coefficientsTheodoulos Garefalakis. ffa, 17(2):183-193, 2011. [doi]

2010

A transform property of Kloosterman sumsIan F. Blake, Theodoulos Garefalakis. DAM, 158(10):1064-1072, 2010. [doi]

2008

Polynomial approximation of bilinear Diffie-Hellman mapsIan F. Blake, Theodoulos Garefalakis. ffa, 14(2):379-389, 2008. [doi]

The trace of an optimal normal element and low complexity normal basesMaria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson. dcc, 49(1-3):199-215, 2008. [doi]

Irreducible polynomials with consecutive zero coefficientsTheodoulos Garefalakis. ffa, 14(1):201-208, 2008. [doi]

2006

On the bit security of the Diffie-Hellman keyIan F. Blake, Theodoulos Garefalakis, Igor Shparlinski. aaecc, 16(6):397-404, 2006. [doi]

2004

On the complexity of the discrete logarithm and Diffie-Hellman problemsIan F. Blake, Theodoulos Garefalakis. jc, 20(2-3):148-170, 2004. [doi]

The generalized Weil pairing and the discrete logarithm problem on elliptic curvesTheodoulos Garefalakis. TCS, 321(1):59-72, 2004. [doi]

2002

On the Security of the Digital Signature AlgorithmIan F. Blake, Theodoulos Garefalakis. dcc, 26(1-3):87-96, 2002.

The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic CurvesTheodoulos Garefalakis. latin 2002: 118-130 [doi]

Securing personal area networksTheodoulos Garefalakis, Christopher J. Mitchell. pimrc 2002: 1257-1259 [doi]

Polynomials over finite fields free from large and small degree irreducible factorsTheodoulos Garefalakis, Daniel Panario. jal, 44(1):98-120, 2002. [doi]

2001

The index calculus method using non-smooth polynomialsTheodoulos Garefalakis, Daniel Panario. moc, 70(235):1253-1264, 2001.

2000

On the discrete logarithm problem in finite fields and on elliptic curvesTheodoulos Garefalakis. PhD thesis, University of Toronto, Canada, 2000. [doi]

1997

A New Family of Randomized Algorithms for List AccessingTheodoulos Garefalakis. esa 1997: 200-216

Sign in or sign up to see more results.

runs on WebDSL