UCL Crypto Group | Dr. Christophe Petit

My research interests go from the mathematical aspects of Cryptography to the modeling and analysis of side-channel and fault attacks. I have recently been focusing on cryptographic hash functions constructed from expander graphs.

Address:	Microelectronics Laboratory, Place du Levant, 3
Office:	b.106
Voice:	+32 (0) 10 47 81 38
Fax:	+32 (0) 10 47 25 98
E-Mail:
Homepage:	http://perso.uclouvain.be/christophe.petit/index.html

BibTeX - Petit

Publications

Jean-Charles Faugère, Christophe Petit, Ludovic Perret, and Guénaël Renault. Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Eurocrypt 2012, April 2012 BibTeX

Marcel Medwed, Christophe Petit, Francesco Regazzoni, Mathieu Renauld, and François-Xavier Standaert. Fresh Re-Keying II: Securing Multiple Parties against Side-Channel and Fault Attacks, 10th Smart Card Research and Advanced Application Conference (CARDIS) 2011, September 2011 BibTeX

Sophie Mawet, Olivier Pereira, and Christophe Petit. Equitable cake cutting without mediator, In Svetla Nikova and Lejla Batina, editor(s), 5th Benelux Workshop on Information and System Security, November 2010 PDF BibTeX

Julien Cathalo, and Christophe Petit. One-time trapdoor one-way functions, In Mike Burmester and Gene Tsudik and Spyros S. Magliveras and Ivana Ilic, editor(s), Information Security - 13th International Conference (ISC 2010) , Volume 6531 of Lecture Notes in Computer Science, pages 283-298, Springer, October 2010 PDF BibTeX

Christophe Petit, and Jean-Jacques Quisquater. Preimages for the Tillich-Zémor hash function, In Alex Biryukov and Guang Gong and Douglas R. Stinson, editor(s), SAC2010 Selected Areas in Cryptography, Volume 6544 of Lecture Notes in Computer Science, pages 282-301, Springer, August 2010 PDF BibTeX

Giacomo de Meulenaer, Christophe Petit, and Jean-Jacques Quisquater. Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?, In Cryptology ePrint Archive, May 2009, Report 2009/229 PDF BibTeX

Christophe Petit, Jean-Jacques Quisquater, Jean-Pierre Tillich, and Gilles Zémor. Hard and Easy Components of Collision Search for the Zémor-Tillich Hash Function : new Attacks and reduced variants with equival, In Marc Fischlin, editor(s), CT-RSA, Lecture Notes in Computer Science, pages 182-194, Springer, April 2009 PDF BibTeX

Christophe Petit, Kristin Lauter, and Jean-Jacques Quisquater. Full Cryptanalysis of LPS and Morgenstern Hash Functions, In Rafail Ostrovsky and Roberto De Prisco and Ivan Visconti, editor(s), SCN 2008 - Sixth Conference on Security and Cryptography for Networks, Volume 5229 of Lecture Notes in Computer Science, pages 263-277, Springer Verlag, September 2008 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

Chong Hee Kim, Philippe Bulens, Christophe Petit, and Jean-Jacques Quisquater. Fault Attacks on Public Key Elements: Application to DLP based Schemes, Fifth European PKI Workshop - EUROPKI 2008, Volume 5057 of Lecture Notes in Computer Science, pages 182 - 195, Springer, June 2008 PDF BibTeX

Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal G. Malkin, and Moti Yung. A Block Cipher based Pseudo Random Number Generator Secure Against Side-Channel Key Recovery, In M. Abe and V. Gligor, editor(s), ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications security, pages 56--65, ACM, March 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.