Publications
Nicolas Veyrat-Charvillon, Benoit Gérard, Mathieu Renauld, and François-Xavier Standaert. An Optimal Key Enumeration Algorithm and its Application to Side-Channel Attacks, In L. Knudsen, editor(s), Selected Areas in Cryptography (SAC 2012), Lecture Notes in Computer Science (LNCS), August 2012, To appear BibTeX
François-Xavier Standaert, Christophe Petit, and Nicolas Veyrat-Charvillon. Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders, Volume 6805 of Lecture Notes in Computer Science (LNCS), pages 283-299, Springer, January 2012 BibTeX
Stéphanie Kerckhof, François Durvaux, Nicolas Veyrat-Charvillon, Francesco Regazzoni, Guerric Meurice de Dormale, and François-Xavier Standaert. Low Cost FPGA Implementations of the SHA-3 Finalists, 10th Smart Card Research and Advanced Application Conference (CARDIS) 2011, September 2011 BibTeX
Mathieu Renauld, François-Xavier Standaert, and Nicolas Veyrat-Charvillon. Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA, Workshop on Cryptographic Hardware and Embedded Systems (CHES 2009), Volume 5747 of Lecture Notes in Computer Science, pages 97-111, Springer, September 2009 PDF BibTeX
Christophe Petit, Jean-Jacques Quisquater, and Nicolas Veyrat-Charvillon. Efficiency and Pseudo-randomness of a Variant of Zémor-Tillich Hash Function, In Joseph Micallef , editor(s), ICECS2008 - IEEE International Conference on Electronics, Circuits, and Systems, pages 906-909, IEEE, August 2008 PDF 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.
