Disclaimer: This page refers to former member of the group. Validity or accuracy of the following information is thus not guaranteed in any way.
I worked at UCL and I have been involved in the G3Card, Reset, and Arthur projects.
| Address: | Microelectronics Laboratory, Place du Levant, 3 |
| E-Mail: | |
Publications
François-Xavier Standaert, Loic van Oldeneel tot Oldenzeel, David Samyde, and Jean-Jacques Quisquater. Differential Power Analysis of FPGAs : How Practical is the Attack?, FPL 2003, Volume 2778 of Lecture Notes in Computer Science, pages 701-709, Springer-Verlag, September 2003 BibTeX
Michael Neve, Eric Peeters, David Samyde, and Jean-Jacques Quisquater. Memories: A Survey of their Secure Uses in Smart Cards, Second International IEEE Security in Storage Workshop - Proceedings of SISW 2003, January 2003 PDF BibTeX
Lilian Bohy, Michael Neve, David Samyde, and Jean-Jacques Quisquater. Principal and Independent Component Analysis for Cryptographic systems with Hardware Unmasked Units, e-Smart 2003, January 2003 BibTeX
Jean-Jacques Quisquater, and David Samyde. Automatic Code Recognition for Smartcards Using a Kohonen Neural Network, Proceedings of the Fifth Smart Card Research and Advanced Application Conference (CARDIS '02), San Jose, CA, USA, November 2002 BibTeX
Jean-Jacques Quisquater, and David Samyde. Eddy current for Magnetic Analysis with Active Sensor, Esmart 2002, Nice, France, September 2002 BibTeX
Jean-Jacques Quisquater, and David Samyde. Side Channel Cryptanalysis, Invited talk in SEcurité de la Communication sur Internet (SECI 02). Tunis, Tunisia, September 2002, Invited talk BibTeX
Jean-Jacques Quisquater, and David Samyde. ElectroMagnetic Analysis (EMA): Measures and Couter-Measures for Smard Cards, Smart Card Programming and Security (E-smart 2001), Volume 2140 of Lecture Notes in Computer Science, pages 200-210, Springer-Verlag, September 2001 BibTeX
Copyright Notice
(
click here to expand/retract)
Some material that is available from this page is copyrighted.
IACR Copyright Notice: Permission is granted for a user to display all
material at this site, to copy the material onto a single computer, and to make
print copies of the material for personal use only. All other rights are
retained by the International Association for Cryptologic Research. In
particular, any other copying, other redistribution, or any commercial use of
the material requires the permission of the publisher, which may be requested
by contacting the International Association for Cryptologic Research.
IEEE Copyright Notice: This material is presented to ensure timely
dissemination of scholarly and technical work. Copyright and all rights therein
are retained by authors or by other copyright holders. All persons copying this
information are expected to adhere to the terms and constraints invoked by each
author's copyright. In most cases, these works may not be reposted without the
explicit permission of the copyright holder.
ACM Copyright Notice: Copyright © 1999 by the Association for
Computing Machinery, Inc. Permission to make digital or hard copies of part of
this work for personal or classroom use is granted without fee provided that
copies are not made or distributed for profit or commercial advantage and that
copies bear this notice and the full citation on the first page or intial
screen of the document. Copyrights for components of this work owned by others
than ACM must be honored. Abstracting with credit is permitted. To copy
otherwise, to republish, to post on servers, or to redistribute to lists,
requires prior specific permission and/or a fee. Request permissions from
Publications Dept., ACM Inc., fax +1 (212) 869-0481, or
permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these
contributions has been transferred to Springer-Verlag Berlin Heidelberg New
York. The copyright transfer covers the exclusive right to reproduce and
distribute the contribution, including reprints, translations, photographic
reproductions, microform, electronic form (offline, online), or any other
reproductions of similar nature. Online available from Springer-Verlag LNCS
series.
