default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColm O'hEigeartaigh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j4]Paulo S. L. M. Barreto, Steven D. Galbraith
, Colm O'hEigeartaigh, Michael Scott:
Efficient pairing computation on supersingular Abelian varieties. Des. Codes Cryptogr. 42(3): 239-271 (2007)- [j3]Robert Ronan, Colin C. Murphy, Tim Kerins, Colm O'hEigeartaigh, Paulo S. L. M. Barreto:
A flexible processor for the characteristic 3 ηT pairing. Int. J. High Perform. Syst. Archit. 1(2): 79-88 (2007) - [j2]Steven D. Galbraith, Colm O'hEigeartaigh, Caroline Sheedy:
Simplified pairing computation and security implications. J. Math. Cryptol. 1(3): 267-281 (2007) - [j1]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins:
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve. J. Syst. Archit. 53(2-3): 85-98 (2007) - [c4]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Tim Kerins, Paulo S. L. M. Barreto:
A Reconfigurable Processor for the Cryptographic nT Pairing in Characteristic 3. ITNG 2007: 11-16 - 2006
- [c3]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins:
FPGA acceleration of the tate pairing in characteristic 2. FPT 2006: 213-220 - [c2]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins, William P. Marnane:
An Embedded Processor for a Pairing-Based Cryptosystem. ITNG 2006: 192-197 - [c1]Colm O'hEigeartaigh, Michael Scott:
Pairing Calculation on Supersingular Genus 2 Curves. Selected Areas in Cryptography 2006: 302-316 - [i8]Colm O'hEigeartaigh, Michael Scott:
Pairing Calculation on Supersingular Genus 2 Curves. IACR Cryptol. ePrint Arch. 2006: 5 (2006) - [i7]Steven D. Galbraith, Colm O'hEigeartaigh, Caroline Sheedy:
Simplified pairing computation and security implications. IACR Cryptol. ePrint Arch. 2006: 169 (2006) - [i6]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Tim Kerins, Paulo S. L. M. Barreto:
Hardware Implementation of the ηT Pairing in Characteristic 3. IACR Cryptol. ePrint Arch. 2006: 371 (2006) - [i5]Augusto Jun Devegili, Colm O'hEigeartaigh, Michael Scott, Ricardo Dahab:
Multiplication and Squaring on Pairing-Friendly Fields. IACR Cryptol. ePrint Arch. 2006: 471 (2006) - 2005
- [i4]Colm O'hEigeartaigh:
Speeding Up Pairing Computation. IACR Cryptol. ePrint Arch. 2005: 293 (2005) - [i3]Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins, William P. Marnane:
A Dedicated Processor for the eta Pairing. IACR Cryptol. ePrint Arch. 2005: 330 (2005) - 2004
- [i2]Colm O'hEigeartaigh:
A Comparison of Point Counting methods for Hyperelliptic Curves over Prime Fields and Fields of Characteristic 2. IACR Cryptol. ePrint Arch. 2004: 241 (2004) - [i1]Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'hEigeartaigh, Michael Scott:
Efficient Pairing Computation on Supersingular Abelian Varieties. IACR Cryptol. ePrint Arch. 2004: 375 (2004)
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 2025-01-09 12:52 CET 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:
