Christophe Petit

According to our database1, Christophe Petit authored at least 51 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems.
J. Cryptology, 2020

Weak instances of SIDH variants under improved torsion-point attacks.
IACR Cryptol. ePrint Arch., 2020

On Adaptive Attacks against Jao-Urbanik's Isogeny-Based Protocol.
IACR Cryptol. ePrint Arch., 2020

2019
Another look at some isogeny hardness assumptions.
IACR Cryptol. ePrint Arch., 2019

Trapdoor DDH groups from pairings and isogenies.
IACR Cryptol. ePrint Arch., 2019

SÉTA: Supersingular Encryption from Torsion Attacks.
IACR Cryptol. ePrint Arch., 2019

Verifiable Delay Functions from Supersingular Isogenies and Pairings.
IACR Cryptol. ePrint Arch., 2019

Expanding the use of quasi-subfield polynomials.
CoRR, 2019

Factoring Products of Braids via Garside Normal Form.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

2018
Better path-finding algorithms in LPS Ramanujan graphs.
J. Mathematical Cryptology, 2018

On the (non) obfuscating power of Garside Normal Forms.
IACR Cryptol. ePrint Arch., 2018

Secure Oblivious Transfer from Semi-Commutative Masking.
IACR Cryptol. ePrint Arch., 2018

Supersingular isogeny graphs and endomorphism rings: reductions and solutions.
IACR Cryptol. ePrint Arch., 2018

A Practical Cryptanalysis of WalnutDSA TM.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017
Full Cryptanalysis of Hash Functions Based on Cubic Ramanujan Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Hard and Easy Problems for Supersingular Isogeny Graphs.
IACR Cryptol. ePrint Arch., 2017

Faster Algorithms for Isogeny Problems using Torsion Point Images.
IACR Cryptol. ePrint Arch., 2017

A Practical Cryptanalysis of WalnutDSA.
IACR Cryptol. ePrint Arch., 2017

2016
On the Security of Supersingular Isogeny Cryptosystems.
IACR Cryptol. ePrint Arch., 2016

Signature Schemes Based On Supersingular Isogeny Problems.
IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
IACR Cryptol. ePrint Arch., 2016

A Generalised Successive Resultants Algorithm.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Cryptographic Hash Functions and Expander Graphs: The End of the Story?
Proceedings of the New Codebreakers, 2016

2015
On Generalized First Fall Degree Assumptions.
IACR Cryptol. ePrint Arch., 2015

Short Accountable Ring Signatures Based on DDH.
IACR Cryptol. ePrint Arch., 2015

Deterministic root finding in finite fields.
ACM Commun. Comput. Algebra, 2015

2014
Finding Roots in GF(p<sup>n</sup>) with the Successive Resultant Algorithm.
IACR Cryptol. ePrint Arch., 2014

On the quaternion ℓ-isogeny path problem.
IACR Cryptol. ePrint Arch., 2014

First fall degree and Weil descent.
Finite Fields Their Appl., 2014

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

2013
Improvement of Faugère et al.'s Method to Solve ECDLP.
Proceedings of the Advances in Information and Computer Security, 2013

2012
On Polynomial Systems Arising from a Weil Descent.
IACR Cryptol. ePrint Arch., 2012

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders.
Proceedings of the Cryptography and Security: From Theory to Applications, 2012

2011
Cayley Hash Functions.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Rubik's for cryptographers.
IACR Cryptol. ePrint Arch., 2011

New Subexponential Algorithms for Factoring in SL(2, fq).
IACR Cryptol. ePrint Arch., 2011

Fresh Re-keying II: Securing Multiple Parties against Side-Channel and Fault Attacks.
Proceedings of the Smart Card Research and Advanced Applications, 2011

2010
Specification of a Knowledge Crossroads for a Productive and Optimised Design.
Proceedings of the Sixth International Conference on Signal-Image Technology and Internet-Based Systems, 2010

Preimages for the Tillich-Zémor Hash Function.
Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

One-Time Trapdoor One-Way Functions.
Proceedings of the Information Security - 13th International Conference, 2010

2009
On graph-based cryptographic hash functions.
PhD thesis, 2009

Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?
IACR Cryptol. ePrint Arch., 2009

Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security.
Proceedings of the Topics in Cryptology, 2009

2008
Full Cryptanalysis of LPS and Morgenstern Hash Function.
IACR Cryptol. ePrint Arch., 2008

Full Cryptanalysis of LPS and Morgenstern Hash Functions.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function.
Proceedings of the 15th IEEE International Conference on Electronics, Circuits and Systems, 2008

Fault Attacks on Public Key Elements: Application to DLP-Based Schemes.
Proceedings of the Public Key Infrastructure, 2008

A block cipher based pseudo random number generator secure against side-channel key recovery.
Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008

2007
A Block Cipher based PRNG Secure Against Side-Channel Key Recovery.
IACR Cryptol. ePrint Arch., 2007


  Loading...