default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil Hanley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c23]Anh-Tuan Hoang, Neil Hanley, Ayesha Khalid, Dur-e-Shahwar Kundi, Máire O'Neill:
Stacked Ensemble Models Evaluation on DL Based SCA. ICSBT/SECRYPT (Revised Selected Papers) 2022: 43-68- [c22]Anh-Tuan Hoang, Neil Hanley, Ayesha Khalid, Dur-e-Shahwar Kundi, Máire O'Neill:
Stacked Ensemble Model for Enhancing the DL based SCA. SECRYPT 2022: 59-68 - 2021
- [j9]Chongyan Gu
, Chip-Hong Chang, Weiqiang Liu, Neil Hanley, Jack Miskelly, Máire O'Neill:
A large-scale comprehensive evaluation of single-slice ring oscillator and PicoPUF bit cells on 28-nm Xilinx FPGAs. J. Cryptogr. Eng. 11(3): 227-238 (2021) - [j8]Florian Unterstein, Nisha Jacob, Neil Hanley, Chongyan Gu, Johann Heyszl:
SCA secure and updatable crypto engines for FPGA SoC bitstream decryption: extended version. J. Cryptogr. Eng. 11(3): 257-272 (2021) - [j7]Chongyan Gu, Weiqiang Liu, Yijun Cui, Neil Hanley, Máire O'Neill, Fabrizio Lombardi:
A Flip-Flop Based Arbiter Physical Unclonable Function (APUF) Design with High Entropy and Uniqueness for FPGA Implementation. IEEE Trans. Emerg. Top. Comput. 9(4): 1853-1866 (2021) - 2020
- [j6]Anh-Tuan Hoang, Neil Hanley, Máire O'Neill:
Plaintext: A Missing Feature for Enhancing the Power of Deep Learning in Side-Channel Analysis? Breaking multiple layers of side-channel countermeasures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(4): 49-85 (2020)
2010 – 2019
- 2019
- [j5]Chongyan Gu, Weiqiang Liu, Neil Hanley, Robert Hesselbarth, Máire O'Neill:
A Theoretical Model to Link Uniqueness and Min-Entropy for PUF Evaluations. IEEE Trans. Computers 68(2): 287-293 (2019) - [c21]Florian Unterstein, Nisha Jacob, Neil Hanley, Chongyan Gu, Johann Heyszl:
SCA Secure and Updatable Crypto Engines for FPGA SoC Bitstream Decryption. ASHES@CCS 2019: 43-53 - [c20]Chongyan Gu, Chip-Hong Chang, Weiqiang Liu, Neil Hanley, Jack Miskelly, Máire O'Neill:
A Large Scale Comprehensive Evaluation of Single-Slice Ring Oscillator and PicoPUF Bit Cells on 28nm Xilinx FPGAs. ASHES@CCS 2019: 101-106 - 2018
- [c19]Qingqing Ma, Chongyan Gu, Neil Hanley, Chenghua Wang, Weiqiang Liu, Máire O'Neill:
A machine learning attack resistant multi-PUF design on FPGA. ASP-DAC 2018: 97-104 - [c18]Robert Hesselbarth, Florian Wilde, Chongyan Gu, Neil Hanley:
Large scale RO PUF analysis over slice type, evaluation time and temperature on 28nm Xilinx FPGAs. HOST 2018: 126-133 - 2017
- [j4]Ciara Rafferty, Máire McLoone, Neil Hanley:
Evaluation of Large Integer Multiplication Methods on Hardware. IEEE Trans. Computers 66(8): 1369-1382 (2017) - [j3]Chongyan Gu, Neil Hanley, Máire O'Neill:
Improved Reliability of FPGA-Based PUF Identification Generator Design. ACM Trans. Reconfigurable Technol. Syst. 10(3): 20:1-20:23 (2017) - [c17]Chongyan Gu, Neil Hanley, Máire O'Neill:
FPGA-based strong PUF with increased uniqueness and entropy properties. ISCAS 2017: 1-4 - 2016
- [j2]Xiaolin Cao, Ciara Moore, Máire O'Neill, Elizabeth O'Sullivan, Neil Hanley:
Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption. IEEE Trans. Computers 65(9): 2794-2806 (2016) - [c16]Chongyan Gu, Yijun Cui, Neil Hanley, Máire O'Neill:
Novel lightweight FF-APUF design for FPGA. SoCC 2016: 75-80 - 2015
- [c15]Neil Hanley, HeeSeok Kim, Michael Tunstall:
Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace. CT-RSA 2015: 431-448 - [c14]Richard Gilmore, Neil Hanley, Máire O'Neill:
Neural network based attack on a masked implementation of AES. HOST 2015: 106-111 - [c13]Philip Hodgers, Neil Hanley, Máire O'Neill:
Pre-processing power traces to defeat random clocking countermeasures. ISCAS 2015: 85-88 - [c12]Hyunjin Ahn, Neil Hanley, Máire O'Neill, Dong-Guk Han:
An Improved Second-Order Power Analysis Attack Based on a New Refined Expecter - - Case Study on Protected AES -. WISA 2015: 174-186 - 2014
- [b1]Neil Hanley:
Profiling side-channel attacks on cryptographic algorithms. University College Cork, Republic of Ireland, 2014 - [c11]Xiaolin Cao, Ciara Moore, Máire O'Neill, Neil Hanley, Elizabeth O'Sullivan:
High-Speed Fully Homomorphic Encryption Over the Integers. Financial Cryptography Workshops 2014: 169-180 - [c10]Ciara Moore, Máire O'Neill, Neil Hanley, Elizabeth O'Sullivan:
Accelerating integer-based fully homomorphic encryption using Comba multiplication. SiPS 2014: 62-67 - [c9]Neil Hanley, Máire O'Neill, Michael Tunstall, William P. Marnane:
Empirical evaluation of multi-device profiling side-channel attacks. SiPS 2014: 226-231 - [c8]Qizhi Tian, Máire O'Neill, Neil Hanley:
Can leakage models be more efficient? non-linear models in side channel attacks. WIFS 2014: 215-220 - 2013
- [c7]Ciara Moore, Neil Hanley, John McAllister, Máire O'Neill, Elizabeth O'Sullivan, Xiaolin Cao:
Targeting FPGA DSP Slices for a Large Integer Multiplier for Integer Based FHE. Financial Cryptography Workshops 2013: 226-237 - [c6]Philip Hodgers, Neil Hanley, Máire O'Neill:
Pre-processing power traces with a phase-sensitive detector. HOST 2013: 131-136 - [i5]Xiaolin Cao, Ciara Moore, Máire O'Neill, Elizabeth O'Sullivan, Neil Hanley:
Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular Reduction. IACR Cryptol. ePrint Arch. 2013: 616 (2013) - 2012
- [c5]Neil Hanley, Máire O'Neill:
Hardware Comparison of the ISO/IEC 29192-2 Block Ciphers. ISVLSI 2012: 57-62 - [i4]Neil Hanley, HeeSeok Kim, Michael Tunstall:
Exploiting Collisions in Addition Chain-based Exponentiation Algorithms. IACR Cryptol. ePrint Arch. 2012: 485 (2012) - 2011
- [j1]Neil Hanley, Michael Tunstall, William P. Marnane:
Using templates to distinguish multiplications from squaring operations. Int. J. Inf. Sec. 10(4): 255-266 (2011) - [i3]Neil Hanley, Michael Tunstall, William P. Marnane:
Using Templates to Distinguish Multiplications from Squaring Operations. IACR Cryptol. ePrint Arch. 2011: 236 (2011) - 2010
- [c4]Brian Baldwin, Andrew Byrne, Liang Lu, Mark Hamilton, Neil Hanley, Máire O'Neill, William P. Marnane:
FPGA Implementations of the Round Two SHA-3 Candidates. FPL 2010: 400-407 - [c3]Jean-François Gallais, Johann Großschädl, Neil Hanley, Markus Kasper, Marcel Medwed, Francesco Regazzoni, Jörn-Marc Schmidt, Stefan Tillich, Marcin Wójcik:
Hardware Trojans for Inducing or Amplifying Side-Channel Leakage of Cryptographic Software. INTRUST 2010: 253-270 - [i2]Brian Baldwin, Andrew Byrne, Liang Lu, Mark Hamilton, Neil Hanley, Máire O'Neill, William P. Marnane:
A Hardware Wrapper for the SHA-3 Hash Algorithms. IACR Cryptol. ePrint Arch. 2010: 124 (2010)
2000 – 2009
- 2009
- [c2]Brian Baldwin, Andrew Byrne, Mark Hamilton, Neil Hanley, Robert P. McEvoy, Weibo Pan, William P. Marnane:
FPGA Implementations of SHA-3 Candidates: CubeHash, Grostl, LANE, Shabal and Spectral Hash. DSD 2009: 783-790 - [c1]Neil Hanley, Michael Tunstall, William P. Marnane:
Unknown Plaintext Template Attacks. WISA 2009: 148-162 - [i1]Brian Baldwin, Andrew Byrne, Mark Hamilton, Neil Hanley, Robert P. McEvoy, Weibo Pan, William P. Marnane:
FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash. IACR Cryptol. ePrint Arch. 2009: 342 (2009)
Coauthor Index
aka: Máire McLoone
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:14 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:
