default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheodoulos Garefalakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j17]Theodoulos Garefalakis, Giorgos Kapetanakis
:
Further Results on the Morgan-Mullen Conjecture. Des. Codes Cryptogr. 87(11): 2639-2654 (2019)- 2017
- [j16]Fabio Enrique Brochero Martínez, Theodoulos Garefalakis, Lucas Reis, Eleni Tzanaki:
On the multiplicative order of the roots of bXqr+1 - aXqr - dX - c. Finite Fields Their Appl. 47: 33-45 (2017) - [j15]Theodoulos Garefalakis, Giorgos Kapetanakis:
Enumerating permutation polynomials. Finite Fields Their Appl. 47: 85-93 (2017) - 2015
- [j14]Theodoulos Garefalakis, Giorgos Kapetanakis:
A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. Finite Fields Their Appl. 35: 61-63 (2015) - 2012
- [j13]Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson:
Gauss periods as constructions of low complexity normal bases. Des. Codes Cryptogr. 62(1): 43-62 (2012) - [j12]Theodoulos Garefalakis, Giorgos Kapetanakis:
On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. Finite Fields Their Appl. 18(4): 832-841 (2012) - 2011
- [j11]Theodoulos Garefalakis:
Self-reciprocal irreducible polynomials with prescribed coefficients. Finite Fields Their Appl. 17(2): 183-193 (2011) - 2010
- [j10]Ian F. Blake, Theodoulos Garefalakis:
A transform property of Kloosterman sums. Discret. Appl. Math. 158(10): 1064-1072 (2010)
2000 – 2009
- 2008
- [j9]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): 199-215 (2008) - [j8]Theodoulos Garefalakis:
Irreducible polynomials with consecutive zero coefficients. Finite Fields Their Appl. 14(1): 201-208 (2008) - [j7]Ian F. Blake, Theodoulos Garefalakis:
Polynomial approximation of bilinear Diffie-Hellman maps. Finite Fields Their Appl. 14(2): 379-389 (2008) - 2006
- [j6]Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski:
On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) - 2004
- [j5]Ian F. Blake, Theodoulos Garefalakis:
On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex. 20(2-3): 148-170 (2004) - [j4]Theodoulos Garefalakis:
The generalized Weil pairing and the discrete logarithm problem on elliptic curves. Theor. Comput. Sci. 321(1): 59-72 (2004) - 2002
- [j3]Ian F. Blake, Theodoulos Garefalakis:
On the Security of the Digital Signature Algorithm. Des. Codes Cryptogr. 26(1-3): 87-96 (2002) - [j2]Theodoulos Garefalakis, Daniel Panario:
Polynomials over finite fields free from large and small degree irreducible factors. J. Algorithms 44(1): 98-120 (2002) - [c3]Theodoulos Garefalakis:
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves. LATIN 2002: 118-130 - [c2]Theodoulos Garefalakis, Christopher J. Mitchell:
Securing personal area networks. PIMRC 2002: 1257-1259 - 2001
- [j1]Theodoulos Garefalakis, Daniel Panario:
The index calculus method using non-smooth polynomials. Math. Comput. 70(235): 1253-1264 (2001) - 2000
- [b1]Theodoulos Garefalakis:
On the discrete logarithm problem in finite fields and on elliptic curves. University of Toronto, Canada, 2000
1990 – 1999
- 1997
- [c1]Theodoulos Garefalakis:
A New Family of Randomized Algorithms for List Accessing. ESA 1997: 200-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
