A Block Cipher based PRNG Secure Against Side-Channel Key Recovery. - Christophe Petit 001; François-Xavier Standaert; Olivier Pereira; Tal Malkin; Moti Yung (IACR Cryptol. ePrint Arch., 2007)

A block cipher based pseudo random number generator secure against side-channel key recovery. - Christophe Petit 001; François-Xavier Standaert; Olivier Pereira; Tal Malkin; Moti Yung (AsiaCCS, 2008)

Fault Attacks on Public Key Elements: Application to DLP-Based Schemes. - Chong Hee Kim; Philippe Bulens; Christophe Petit 001; Jean-Jacques Quisquater (EuroPKI, 2008)

Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function. - Christophe Petit 001; Nicolas Veyrat-Charvillon; Jean-Jacques Quisquater (ICECS, 2008)

Full Cryptanalysis of LPS and Morgenstern Hash Functions. - Christophe Petit 001; Kristin E. Lauter; Jean-Jacques Quisquater (SCN, 2008)

Full Cryptanalysis of LPS and Morgenstern Hash Function. - Christophe Petit 001; Kristin E. Lauter; Jean-Jacques Quisquater (IACR Cryptol. ePrint Arch., 2008)

Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. - Christophe Petit 001; Jean-Jacques Quisquater; Jean-Pierre Tillich; Gilles Zémor (CT-RSA, 2009)

Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ? - Giacomo de Meulenaer; Christophe Petit 001; Jean-Jacques Quisquater (IACR Cryptol. ePrint Arch., 2009)

On graph-based cryptographic hash functions. - Christophe Petit 001 (2009)

One-Time Trapdoor One-Way Functions. - Julien Cathalo; Christophe Petit 001 (ISC, 2010)

Preimages for the Tillich-Zémor Hash Function. - Christophe Petit 001; Jean-Jacques Quisquater (Selected Areas in Cryptography, 2010)

Fresh Re-keying II: Securing Multiple Parties against Side-Channel and Fault Attacks. - Marcel Medwed; Christophe Petit 001; Francesco Regazzoni 001; Mathieu Renauld; François-Xavier Standaert (CARDIS, 2011)

New Subexponential Algorithms for Factoring in SL(2, fq). - Jean-Charles Faugère; Ludovic Perret; Christophe Petit 001; Guénaël Renault (IACR Cryptol. ePrint Arch., 2011)

Rubik's for cryptographers. - Christophe Petit 001; Jean-Jacques Quisquater (IACR Cryptol. ePrint Arch., 2011)

Cayley Hash Functions. - Christophe Petit 001; Jean-Jacques Quisquater (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)

Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders. - François-Xavier Standaert; Christophe Petit 001; Nicolas Veyrat-Charvillon (Cryptography and Security, 2012)

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. - Jean-Charles Faugère; Ludovic Perret; Christophe Petit 001; Guénaël Renault (EUROCRYPT, 2012)

On Polynomial Systems Arising from a Weil Descent. - Christophe Petit 001; Jean-Jacques Quisquater (IACR Cryptol. ePrint Arch., 2012)

Improvement of Faugère et al.'s Method to Solve ECDLP. - Yun-Ju Huang; Christophe Petit 001; Naoyuki Shinohara; Tsuyoshi Takagi (IWSEC, 2013)

Towards factoring in $${SL(2, , mathbb{F}_{2^n})}$$. - Christophe Petit 001 (Des. Codes Cryptogr., 2014)

First fall degree and Weil descent. - Timothy J. Hodges; Christophe Petit 001; Jacob Schlather (Finite Fields Their Appl., 2014)

On the quaternion ℓ-isogeny path problem. - David Kohel; Kristin E. Lauter; Christophe Petit 001; Jean-Pierre Tignol (IACR Cryptol. ePrint Arch., 2014)

Finding Roots in GF(pn) with the Successive Resultant Algorithm. - Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2014)

Finding roots in with the successive resultants algorithm. - Christophe Petit 001 (LMS J. Comput. Math., 2014)

On the quaternion -isogeny path problem. - David Kohel; Kristin E. Lauter; Christophe Petit 001; Jean-Pierre Tignol (LMS J. Comput. Math., 2014)

Deterministic root finding in finite fields. - Luca De Feo; Christophe Petit 001; Michaël Quisquater (ACM Commun. Comput. Algebra, 2015)

Short Accountable Ring Signatures Based on DDH. - Jonathan Bootle; Andrea Cerulli; Pyrros Chaidos; Essam Ghadafi; Jens Groth; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2015)

On Generalized First Fall Degree Assumptions. - Yun-Ju Huang; Christophe Petit 001; Naoyuki Shinohara; Tsuyoshi Takagi (IACR Cryptol. ePrint Arch., 2015)

Cryptographic Hash Functions and Expander Graphs: The End of the Story? - Christophe Petit 001; Jean-Jacques Quisquater (The New Codebreakers, 2016)

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields. - Christophe Petit 001; Michiel Kosters; Ange Messeng (Public Key Cryptography (2), 2016)

A Generalised Successive Resultants Algorithm. - James H. Davenport; Christophe Petit 001; Benjamin Pring (WAIFI, 2016)

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. - Jonathan Bootle; Andrea Cerulli; Pyrros Chaidos; Jens Groth; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2016)

Signature Schemes Based On Supersingular Isogeny Problems. - Steven D. Galbraith; Christophe Petit 001; Javier Silva 001 (IACR Cryptol. ePrint Arch., 2016)

On the Security of Supersingular Isogeny Cryptosystems. - Steven D. Galbraith; Christophe Petit 001; Barak Shani; Yan Bo Ti (IACR Cryptol. ePrint Arch., 2016)

A Practical Cryptanalysis of WalnutDSA. - Daniel Hart; Dohoon Kim; Giacomo Micheli; Guillermo Pascual-Perez; Christophe Petit 001; Yuxuan Quek (IACR Cryptol. ePrint Arch., 2017)

Faster Algorithms for Isogeny Problems using Torsion Point Images. - Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2017)

Hard and Easy Problems for Supersingular Isogeny Graphs. - Christophe Petit 001; Kristin E. Lauter (IACR Cryptol. ePrint Arch., 2017)

Full Cryptanalysis of Hash Functions Based on Cubic Ramanujan Graphs. - Hyungrok Jo; Christophe Petit 001; Tsuyoshi Takagi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

A Practical Cryptanalysis of WalnutDSA TM. - Daniel Hart; Dohoon Kim; Giacomo Micheli; Guillermo Pascual-Perez; Christophe Petit 001; Yuxuan Quek (Public Key Cryptography (1), 2018)

Supersingular isogeny graphs and endomorphism rings: reductions and solutions. - Kirsten Eisenträger; Sean Hallgren; Kristin E. Lauter; Travis Morrison; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2018)

Secure Oblivious Transfer from Semi-Commutative Masking. - Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Christophe Petit 001; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2018)

On the (non) obfuscating power of Garside Normal Forms. - Simon-Philipp Merz; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2018)

Better path-finding algorithms in LPS Ramanujan graphs. - Eduardo Carvalho Pinto; Christophe Petit 001 (J. Math. Cryptol., 2018)

Supersingular isogeny graphs in cryptography. - Kristin E. Lauter; Christophe Petit 001 (BCC, 2019)

Factoring Products of Braids via Garside Normal Form. - Simon-Philipp Merz; Christophe Petit 001 (Public Key Cryptography (2), 2019)

Expanding the use of quasi-subfield polynomials. - Marie Euler; Christophe Petit 001 (CoRR, 2019)

Verifiable Delay Functions from Supersingular Isogenies and Pairings. - Luca De Feo; Simon Masson; Christophe Petit 001; Antonio Sanso (IACR Cryptol. ePrint Arch., 2019)

SÉTA: Supersingular Encryption from Torsion Attacks. - Cyprien Delpech de Saint Guilhem; Péter Kutas; Christophe Petit 001; Javier Silva 001 (IACR Cryptol. ePrint Arch., 2019)

Trapdoor DDH groups from pairings and isogenies. - Péter Kutas; Christophe Petit 001; Javier Silva 001 (IACR Cryptol. ePrint Arch., 2019)

Another look at some isogeny hardness assumptions. - Simon-Philipp Merz; Romy M. Minko; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2019)

Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT. - Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Christophe Petit 001; Nigel P. Smart (CANS, 2020)

On Adaptive Attacks against Jao-Urbanik's Isogeny-Based Protocol. - Andrea Basso 002; Péter Kutas; Simon-Philipp Merz; Christophe Petit 001; Charlotte Weitkämper (IACR Cryptol. ePrint Arch., 2020)

SQISign: compact post-quantum signatures from quaternions and isogenies. - Luca De Feo; David Kohel; Antonin Leroux; Christophe Petit 001; Benjamin Wesolowski (IACR Cryptol. ePrint Arch., 2020)

On Index Calculus Algorithms for Subfield Curves. - Steven D. Galbraith; Robert Granger; Simon-Philipp Merz; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2020)

Stronger bounds on the cost of computing Groebner bases for HFE systems. - Elisa Gorla; Daniela Müller; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2020)

Weak instances of SIDH variants under improved torsion-point attacks. - Péter Kutas; Chloe Martindale; Lorenz Panny; Christophe Petit 001; Katherine E. Stange (IACR Cryptol. ePrint Arch., 2020)

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem. - Ming-Deh A. Huang; Michiel Kosters; Christophe Petit 001; Sze Ling Yeo; Yang Yun (J. Math. Cryptol., 2020)

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems. - Steven D. Galbraith; Christophe Petit 001; Javier Silva 001 (J. Cryptol., 2020)

Séta: Supersingular Encryption from Torsion Attacks. - Luca De Feo; Cyprien Delpech de Saint Guilhem; Tako Boris Fouotsa; Péter Kutas; Antonin Leroux; Christophe Petit 001; Javier Silva 001; Benjamin Wesolowski (ASIACRYPT (4), 2021)

SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH. - Tako Boris Fouotsa; Christophe Petit 001 (ASIACRYPT (4), 2021)

Improved Torsion-Point Attacks on SIDH Variants. - Victoria de Quehen; Péter Kutas; Chris Leonardi; Chloe Martindale; Lorenz Panny; Christophe Petit 001; Katherine E. Stange (CRYPTO (3), 2021)

SimS: A Simplification of SiGamal. - Tako Boris Fouotsa; Christophe Petit 001 (PQCrypto, 2021)

New results on quasi-subfield polynomials. - Marie Euler; Christophe Petit 001 (Finite Fields Their Appl., 2021)

Cryptanalysis of an oblivious PRF from supersingular isogenies. - Andrea Basso 002; Péter Kutas; Simon-Philipp Merz; Christophe Petit 001; Antonio Sanso (IACR Cryptol. ePrint Arch., 2021)

InSIDH: a Simplification of SiGamal. - Tako Boris Fouotsa; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2021)

A New Adaptive Attack on SIDH. - Tako Boris Fouotsa; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2021)

SHealS and HealS: isogeny-based PKEs from akey validation method for SIDH. - Tako Boris Fouotsa; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2021)

One-way functions and malleability oracles: Hidden shift attacks on isogeny-based protocols. - Péter Kutas; Simon-Philipp Merz; Christophe Petit 001; Charlotte Weitkämper (IACR Cryptol. ePrint Arch., 2021)

Shorter quantum circuits. - Vadym Kliuchnikov; Kristin E. Lauter; Romy M. Minko; Christophe Petit 001; Adam Paetznick (IACR Cryptol. ePrint Arch., 2022)

Stronger bounds on the cost of computing Gröbner bases for HFE systems. - Elisa Gorla; Daniela Mueller; Christophe Petit 001 (J. Symb. Comput., 2022)

Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves. - Benjamin Bencina; Péter Kutas; Simon-Philipp Merz; Christophe Petit 001; Miha Stopar; Charlotte Weitkämper (IACR Cryptol. ePrint Arch., 2023)

Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH. - Mingjie Chen; Muhammad Imran 022; Gábor Ivanyos; Péter Kutas; Antonin Leroux; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2023)

Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits based on Isogenies. - Mingjie Chen; Yi-Fu Lai; Abel Laval; Laurane Marco; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2023)

M-SIDH and MD-SIDH: countering SIDH attacks by masking information. - Tako Boris Fouotsa; Tomoki Moriya; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2023)

Torsion point attacks on 'SIDH-like' cryptosystems. - Péter Kutas; Christophe Petit 001 (IET Inf. Secur., 2023)

Guest Editorial: Guest Editorial on Cryptanalysis of (NIST PQC) post-quantum proposals. - Ayoub Otmani; Christophe Petit 001; Mehdi Tibouchi (IET Inf. Secur., 2023)

Proving knowledge of isogenies: a survey. - Ward Beullens; Luca De Feo; Steven D. Galbraith; Christophe Petit 001 (Des. Codes Cryptogr., 2023)

Shorter quantum circuits via single-qubit gate approximation. - Vadym Kliuchnikov; Kristin E. Lauter; Romy M. Minko; Adam Paetznick; Christophe Petit 001 (Quantum, 2023)

Attacking trapdoors from matrix products. - Thomas Decru; Tako Boris Fouotsa; Paul Frixons; Valerie Gilchrist; Christophe Petit 001 (IACR Commun. Cryptol., 2024)

Failing to Hash Into Supersingular Isogeny Graphs. - Jeremy Booher; Ross Bowden; Javad Doliskani; Tako Boris Fouotsa; Steven D. Galbraith; Sabrina Kunzweiler; Simon-Philipp Merz; Christophe Petit 001; Benjamin Smith 003; Katherine E. Stange; Yan Bo Ti; Christelle Vincent; et al. (Comput. J., 2024)

Faster algorithms for isogeny computations over extensions of finite fields. - Shiping Cai; Mingjie Chen; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2024)

Solving the Tensor Isomorphism Problem for special orbits with low rank points: Cryptanalysis and repair of an Asiacrypt 2023 commitment scheme. - Valerie Gilchrist; Laurane Marco; Christophe Petit 001; Gang Tang (IACR Cryptol. ePrint Arch., 2024)

Radical 2-isogenies and cryptographic hash functions in dimensions 1, 2 and 3. - Sabrina Kunzweiler; Luciano Maino; Tomoki Moriya; Christophe Petit 001; Giacomo Pope; Damien Robert 001; Miha Stopar; Yan Bo Ti (IACR Cryptol. ePrint Arch., 2024)

KLaPoTi: An asymptotically efficient isogeny group action from 2-dimensional isogenies. - Lorenz Panny; Christophe Petit 001; Miha Stopar (IACR Cryptol. ePrint Arch., 2024)

Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology. - Rishiraj Bhattacharyya; Sreehari Kollath; Christophe Petit 001 (ACISP (2), 2025)

Computing the Endomorphism Ring of a Supersingular Elliptic Curve from a Full Rank Suborder. - Mingjie Chen; Christophe Petit 001 (EUROCRYPT (6), 2025)

KLPT²: Algebraic Pathfinding in Dimension Two and Applications. - Wouter Castryck; Thomas Decru; Péter Kutas; Abel Laval; Christophe Petit 001; Yan Bo Ti (IACR Cryptol. ePrint Arch., 2025)

Another Look at the Quantum Security of the Vectorization Problem with Shifted Inputs. - Paul Frixons; Valerie Gilchrist; Péter Kutas; Simon-Philipp Merz; Christophe Petit 001 (IACR Cryptol. ePrint Arch., 2025)