Christophe Petit
Preprints
PhD thesis
Journal papers
International conferences
Book chapters
Local conferences
Technical reports
Selected talks
Preprints
Traveling in supersingular elliptic curves isogeny graphs
Christophe Petit, Kristin Lauter
In preparation.
Efficient Zero-Knowledge Protocols for Arithmetic Circuits in the Discrete Log Setting
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit
Preprint
Application of the affine geometry of GF(q^n) to root finding
Luca De Feo, Christophe Petit, and Michael Quisquater
Preprint
On Generalized First Fall Degree Assumptions
Huang Yun-Ju, Christophe Petit, Naoyuki Shinohara, and Tsuyoshi Takagi
Paper.
Bounding HFE with SRA
Christophe Petit
Preprint
Paper.
New subexponential algorithms for factoring in SL(2,2^n)
Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault
Paper.
ZesT : an all-purpose hash function based on Zémor-Tillich
Christophe Petit, Giacomo de Meulenaer, Jean-Jacques Quisquater, Jean-Pierre Tillich, Nicolas Veyrat-Charvillon and Gilles Zémor
Paper.
Hardware Implementations of a Variant of the Zémor-Tillich Hash Function
Giacomo de Meulenaer, Christophe Petit and Jean-Jacques Quisquater
Preprint
Paper.
PhD thesis
Cryptographic hash functions from expander graphs
Christophe Petit
PhD thesis, UCL (2009)
Text.
Slides of the private defense.
Slides of the public defense.
Journal papers
First fall degree and Weil Descent
Tim Hodges, Christophe Petit and Jacob Schlather
Finite Fields and their Applications, Volume 30, November 2014, Pages 155–177.
Preliminary version presented at YACC2012 conference under the title Degree of Regularity for Systems arising from Weil Descent
Paper.
On the quaternion $\ell$-isogeny path problem
LMS Journal of Computation and Mathematics, Volume 17, Issue A, pp 418-432, 2014. Special issue for ANTS, Algorithmic Number Theory Symposium conference.
David Kohel, Kristin Lauter, Christophe Petit, Jean-Pierre Tignol
Preprint. LMS link.
Finding Roots in GF(p^n) with the Successive Resultant Algorithm
Christophe Petit
LMS Journal of Computation and Mathematics, Volume 17, Issue A, pp 203-217, 2014. Special issue for ANTS, Algorithmic Number Theory Symposium conference.
Preprint. LMS link.
On a particular case of the bisymmetric equation for quasigroups
Christophe Petit, François-Xavier Standaert, Mathieu Renauld
Acta Mathematica Hungarica, Volume 143, Issue 2, pp 330-336, July 2014.
Preprint. Springer link
Rubik's for cryptographers
Christophe Petit and Jean-Jacques Quisquater
Notices of the American Mathematical Society, Volume 60, Number 6, pp 733-739, June/July 2013.
Paper. Extended version.
Rubik's for cryptographers
Christophe Petit and Jean-Jacques Quisquater
Mathematical Advance in Translation, Volume 33, Number 1, pp 5-13, April 2014.
NB: Chinese translation of the previous paper, with permission of the AMS
Towards factoring in SL(2,2^n)
Christophe Petit
Design, Codes and Cryptography, Volume 71, Issue 3, pp 409-431.
Preprint. Springer link.
International peer-reviewed conferences
Short Accountable Ring Signatures from the DDH Assumption
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit
To appear at ESORICS 2015
Improvement of Faugère et al.'s method to solve ECDLP
Huang Yun-Ju, Christophe Petit, Naoyuki Shinohara, and Tsuyoshi Takagi
IWSEC 2013 - Advances in Information and Computer Security
Paper.
On polynomial systems arising from a Weil descent
Christophe Petit and Jean-Jacques Quisquater
Asiacrypt 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security
Paper. Extended version.
Improving the complexity of index calculus algorithms in elliptic curves over binary fields
Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault
Eurocrypt 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques
Paper.
Masking with Randomized Look Up Tables (Towards Preventing Side-Channel Attacks of All)
François-Xavier Standaert, Christophe Petit, Nicolas Veyrat-Charvillon
Cryptography and Security: From Theory to Applications - Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday.
Paper.
Fresh Re-Keying II: Securing Multiple Parties against Side-Channel and Fault Attacks
Marcel Medwed, Christophe Petit, Francesco Regazzoni, Mathieu Renauld, and François-Xavier Standaert
CARDIS 2011 - 10th Smart Card Research and Advanced Application Conference
Paper.
One-time trapdoor one-way functions
Julien Cathalo, Christophe Petit
ISC 2010 - 13th Information Security Conference
Paper. Extended version.
Slides.
Preimage algorithms for the Tillich-Zémor hash function
Christophe Petit, and Jean-Jacques Quisquater
SAC 2010 - Selected areas in Cryptography
Paper. Slides.
Hard and easy Components of Collision Search in the Zémor-Tillich Hash Function : New Instances and Reduced Variants with equivalent Security
Christophe Petit, Jean-Jacques Quisquater, Jean-Pierre Tillich and Gilles Zémor
CT-RSA 2009 - Topics in Cryptology, The Cryptographers' Track at the RSA Conference 2009
Paper. Slides at CT-RSA.
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Christophe Petit, Kristin Lauter, and Jean-Jacques Quisquater
SCN 2008 - Sixth Conference on Security and Cryptography for Networks
Paper. Slides at SCN08.
Efficiency and Pseudo-Randomness of a Variant of Zémor-Tillich Hash Function
Christophe Petit, Nicolas Veyrat-Charvillon, and Jean-Jacques Quisquater
WIC'2008 - Symposium on Information Theory and
Communication in the BénéluxISECS'2008 - The 15th IEEE International Conference on Electronics, Circuits and
Systems (invited paper)
Paper. Slides at WIC08.
Fault Attacks on Public Key Elements: Application to DLP based Schemes
Chong Hee Kim, Philippe Bulens, Christophe Petit, and Jean-Jacques Quisquater
EUROPKI 2008 - Fifth European PKI Workshop
Paper.
Slides.
A Block Cipher based Pseudo Random Number Generator Secure Against Side-Channel Key Recovery
Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal G. Malkin, Moti Yung
ASIACCS'08 - ACM Symposium on Information, Computer and Communications Security
Paper. Slides.
Book chapters
Cayley hash functions
Christophe Petit, and Jean-Jacques Quisquater
Encyclopedia of cryptography and security - 2nd edition
Cryptographic Hash Functions and Expander Graphs: The End of the Story ?
Christophe Petit and Jean-Jacques Quisquater
To appear in a volume in honor of David Kahn
Local conferences
Degree of Regularity for Systems arising from Weil Descent
Tim Hodges, Christophe Petit and Jacob Schlather
YACC 2012 - Yet Another Conference on Cryptography
Equitable Cake Cutting without Mediator
Sophie Mawet, Olivier Pereira and Christophe Petit
IT Bénélux 2010 - 5th Benelux Workshop on Information and System Security
Paper.
Technical reports
ZesT : an all-purpose hash function based on Zémor-Tillich
Christophe Petit, Giacomo de Meulenaer, Jean-Jacques Quisquater, Jean-Pierre Tillich, Nicolas Veyrat-Charvillon and Gilles Zémor
Preprint (2009)
Paper.
Hardware Implementations of a Variant of the Zémor-Tillich Hash Function
Giacomo de Meulenaer, Christophe Petit and Jean-Jacques Quisquater
Preprint (2009)
Paper.
Cayley Hashes: A Class of Efficient Graph-based Hash Functions
Christophe Petit, Kristin Lauter, and Jean-Jacques Quisquater
Preprint (2007)
Paper.
Selected talks
Rubik's for cryptographers: symmetric key cryptography from public key mathematics
Workshop on the Security of symmetric ciphers in network protocols, Edinburgh, UK, May 2015.
On the quaternion \ell-isogeny problem.
Université de Neuchâtel, Neuchâtel, Switzerland, March 2015.
Ecole Polytechnique, Paris, France, February 2015.
Université de Versailles-Saint-Quentin, November 2014.
Algorithmic Number Theory Symposium (ANTS), August 2014, GyeongJu, South Korea.
Bounding HFE with SRA
DIMACS Workshop on the Mathematics of Post-Quantum Cryptography, January 2015.
On the complexity of index calculus algorithms for ECDLP over composite fields.
University College London, September 2014.
Shanghai Jiao Tong University, Shanghai, China, August 2014.
Oxford junior Number Theory Seminars, March 2014, Oxford, UK.
Introductory talk at the pannel discussion of the Workshop on Algebraic constructions for the fundations of a safe society, August 2013, Fukuoka, Japan.
Elliptic curve cryptography conference, October 2012, Queretaro, Mexico.
Factorization problem in non-Abelian groups
Beijing University of Posts and Telecommunications, Beijing, China, August 2014.
Finding roots in GF(p^n) with the successive resultants algorithm
Algorithmic Number Theory Symposium (ANTS), August 2014, GyeongJu, South Korea.
The successive resultants algorithm and its connection to binary ECDLP
DLP 2014 Conference, May 2014, Ascona, Switzerland.
Rubik's for cryptographers
Workshop on Algebraic constructions for the fundations of a safe society, August 2013, Fukuoka, Japan.
From Rubik's to cryptography: a tour of mathematical challenges in the field
Control and systems seminars, ULG, November 2012, Liège, Belgium.
On polynomial systems arising from a Weil descent
Center for Cryptology and Information Security (CCIS), Florida Atlantic University, Boca Raton, March 2013.
Workshop on solving multivariate polynomial systems and related topics, March 2013, Fukuoka, Japan.
Institute of Mathematics for Industry, Kyushu University, February 2013, Fukuoka, Japan.
Ecole Normale Supérieure, February 2013, Paris, France.
State Key Laboratory of Information Security (SKLOIS) seminars, December 2012, Chinese Academy of Science, Beijing, China.
Institute for Interdisciplinary Information Sciences, December 2012, Tsinghua University, Beijing, China.
Asiacrypt 2012 conference, December 2012, Beijing, China.
Séminaires Caramel, November 2012, INRIA-Université Henri Poincarré, Nancy, France.
Séminaires Qualsec, October 2012, Université Libre de Bruxelles, Brussels, Belgium.
Seminaris del grup MAK, May 2012, Universitat Politècnica de Catalunya, Barcelona, Spain.
Séminaires "Codage, Cryptologie, Algorithmes", April 2012, Institut Henri Poincarré, Paris, France
Séminaires crypto de LIX, March 2012, Ecole Polytechnique, Paris, France.
Séminaires de l'institut de Mathématiques de Luminy, March 2012, Luminy, France.
Rubik's for cryptographers: Towards factoring in $SL(2,\mathbb{F}_{2^n})$
Qualcomm Research crypto seminars, November 2011, San Diego, CA, USA.
Cryptography and security seminars, November 2011, UCSD, San Diego, CA, USA.
Computing paths in large Cayley graphs and cryptanalytic applications
IWONT workshop, July 2011, Brussels, Belgium.
Hash functions and Cayley graphs: The end of the story ?
Salsa team, LIP6, Université Pierre et Marie Curie, Paris, November 2010.
Center for Cryptology and Information Security (CCIS), Florida Atlantic University, Boca Raton, November 2010.
Workshop on Computer Security and Cryptography, CRM, Montréal, April 2010.
Microsoft Research cryptography seminars, Seattle, March 2010.
Institut de mathématiques de Bordeaux I, December 2009.
ECRYPT II SHA-3 workshop, Tenerife, November 2009.
One-time trapdoor one-way functions
Information security conference, October 2010, Boca Raton, USA.
Preimage algorithms for the Tillich-Zémor hash function
Selected areas in cryptography, August 2010, Waterloo, Canada.
Hard and Easy Components of Collision Search for the Zémor-Tillich Hash Function : new Attacks and reduced variants with equivalent security
The Cryptographers' Track at the RSA Conference, April 2009, San Francisco, USA.
Cryptographic Hash Functions from Expander Graphs
Large graph group seminars, February 2009, Louvain-la-Neuve, Belgium.
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Conference on Security and Cryptography for Networks, September 2008, Amalfi, Italy.
Fault Attacks on Public Key Elements: Application to DLP based Schemes
Public Key Infrastructure, June 2008, Trondheim, Norway.
Cryptographic hash functions from expander graphs
ECRYPT hash workshop, Leiden, June 2008.
A Block Cipher based Pseudo Random Number Generator Secure Against Side-Channel Key Recovery
ACM Symposium on Information, Computer and Communications Security, March 2008, Tokyo, Japan.
Security in a grey-box model
Microsoft Research cryptography seminars, Seattle, July 2007.