Michael Tunstall

dblp:55/2065 · also Mike Tunstall · DBLP profile ↗
← Back
24ranked-venue papers
7as first author
2since 2021 · last 2021
0000-0002-7107-8644ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 22 · 7 first-author · 2 since 2021Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2021 Improvements to RSA Key Generation and CRT on Embedded Devices
Michael Hamburg, Michael Tunstall, Qinglai Xiao
CT-RSA2
2021 Boolean Exponent Splitting
Michael Tunstall, Louiza Papachristodoulou, Kostas Papagiannopoulos
SECRYPT1
2015 SoC It to EM: ElectroMagnetic Side-Channel Attacks on a Complex System-on-Chip
Jake Longo, Elke De Mulder, Dan Page, Michael Tunstall
CHES4
2015 Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace
Neil Hanley, Michael Tunstall
CT-RSA3
2015 Randomizing the Montgomery Powering Ladder
Duc-Phong Le, Chik How Tan, Michael Tunstall
WISTP3
2014 Simulatable Leakage: Analysis, Pitfalls, and New Constructions
Jake Longo, Daniel P. Martin 0001, Elisabeth Oswald, Dan Page, Martijn Stam, Michael Tunstall
ASIACRYPT (1)6
2013 Masking Tables - An Underestimated Security Risk
Michael Tunstall, Carolyn Whitnall, Elisabeth Oswald
FSE1
2012 Compiler Assisted Masking
Andrew Moss, Elisabeth Oswald, Dan Page, Michael Tunstall
CHES4
2012 Harnessing Biased Faults in Attacks on ECC-Based Signature Schemes
abstract
This paper presents an extension of the byte-fault attack on signature schemes presented by Giraud et al. Our work extends their attack in a number of ways, but the main focus is an alternative fault model motivated by existing fault injection results. Instead of assuming faults are uniformly distributed (i.e., a given bit is flipped with probability 1/2), we consider the case where faults are biased (i.e., the probability differs from 1/2). Our results show that injecting biased faults allows an attacker to reveal security-critical data with significantly fewer faults and/or a significantly faster search through the remaining candidates.
Kimmo Järvinen 0001, Céline Blondeau, Dan Page, Michael Tunstall
FDTC4
2012 Improved "Partial Sums"-based Square Attack on AES
Michael Tunstall
SECRYPT1
2011 Can Code Polymorphism Limit Information Leakage?
Antoine Amarilli, Sascha Müller 0003, David Naccache, Dan Page, Pablo Rauzy, Michael Tunstall
WISTP6
2011 Differential Fault Analysis of the Advanced Encryption Standard Using a Single Fault
Michael Tunstall, Debdeep Mukhopadhyay, Subidh Ali
WISTP1
2010 Improved Fault Analysis of Signature Schemes
Christophe Giraud 0001, Erik Woodward Knudsen, Michael Tunstall
CARDIS3
2010 Coordinate Blinding over Large Prime Fields
Michael Tunstall, Marc Joye
CHES1
2009 Random Order m-ary Exponentiation
Michael Tunstall
ACISP1
2009 Attacking smart card systems: Theory and practice
Konstantinos Markantonakis, Michael Tunstall, Gerhard P. Hancke 0002, Ioannis G. Askoxylakis, Keith Mayes
Inf. Secur. Tech. Rep.2
2009 Isolated WDDL: A Hiding Countermeasure for Differential Power Analysis on FPGAs
abstract
Security protocols are frequently accelerated by implementing the underlying cryptographic functions in reconfigurable hardware. However, unprotected hardware implementations are susceptible to side-channel attacks, and Differential Power Analysis (DPA) has been shown to be especially powerful. In this work, we evaluate and compare the effectiveness of common hiding countermeasures against DPA in FPGA-based designs, using the Whirlpool hash function as a case study. In particular, we develop a new design flow called Isolated WDDL (IWDDL). In contrast with previous works, IWDDL isolates the direct and complementary circuit paths, and also provides DPA resistance in the Hamming distance power model. The analysis is supported using actual implementation results.
Robert P. McEvoy, Colin C. Murphy, William P. Marnane, Michael Tunstall
ACM Trans. Reconfigurable Technol. Syst.4
2007 Montgomery Multiplication with Redundancy Check
abstract
This paper presents a method of adding redundant code to the Montgomery multiplication algorithm, to ensure that a fault attack during its calculation can be detected. This involves having checksums on the input variables that are then used to calculate a valid checksum for the output variable, in a similar manner to that proposed by Walter. However, it is shown that the proposed method is more secure than the previous work, as all the variables required to calculate Montgomery multiplication are protected.
Michael Tunstall
FDTC2
2007 Securing OpenSSL against Micro-Architectural Attacks
Marc Joye, Michael Tunstall
SECRYPT2
2007 Efficient Use of Random Delays in Embedded Software
Michael Tunstall, Olivier Benoît
WISTP1
2006 Cache Based Power Analysis Attacks on AES
Jacques J. A. Fournier, Michael Tunstall
ACISP2
2006 Fault Analysis of DPA-Resistant Algorithms
Frédéric Amiel, Christophe Clavier, Michael Tunstall
FDTC3
2006 The Sorcerer's Apprentice Guide to Fault Attacks
abstract
The effect of faults on electronic systems has been studied since the 1970s when it was noticed that radioactive particles caused errors in chips. This led to further research on the effect of charged particles on silicon, motivated by the aerospace industry, which was becoming concerned about the effect of faults in airborne electronic systems. Since then various mechanisms for fault creation and propagation have been discovered and researched. This paper covers the various methods that can be used to induce faults in semiconductors and exploit such errors maliciously. Several examples of attacks stemming from the exploiting of faults are explained. Finally a series of countermeasures to thwart these attacks are described.
Hagai Bar-El, Hamid Choukri, David Naccache, Michael Tunstall, Claire Whelan
Proc. IEEE4
2000 How to Explain Side-Channel Leakage to Your Kids
David Naccache, Michael Tunstall
CHES2