Christophe Petit

Miha Stopar

IACR Cryptol. ePrint Arch., 2024

Radical 2-isogenies and cryptographic hash functions in dimensions 1, 2 and 3.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Faster algorithms for isogeny computations over extensions of finite fields.

[BibT_eX]

[DOI]

Shiping Cai

Mingjie Chen

IACR Cryptol. ePrint Arch., 2024

Failing to Hash Into Supersingular Isogeny Graphs.

[BibT_eX]

[DOI]

Comput. J., 2024

Attacking trapdoors from matrix products.

[BibT_eX]

[DOI]

IACR Commun. Cryptol., 2024

2023

Shorter quantum circuits via single-qubit gate approximation.

[BibT_eX]

[DOI]

Quantum, December, 2023

Proving knowledge of isogenies: a survey.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., November, 2023

Guest Editorial: Guest Editorial on Cryptanalysis of (NIST PQC) post-quantum proposals.

[BibT_eX]

[DOI]

Ayoub Otmani

Mehdi Tibouchi

IET Inf. Secur., March, 2023

Torsion point attacks on 'SIDH-like' cryptosystems.

[BibT_eX]

[DOI]

Péter Kutas

IET Inf. Secur., March, 2023

M-SIDH and MD-SIDH: countering SIDH attacks by masking information.

[BibT_eX]

[DOI]

Tomoki Moriya

IACR Cryptol. ePrint Arch., 2023

Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits based on Isogenies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2022

Stronger bounds on the cost of computing Gröbner bases for HFE systems.

[BibT_eX]

[DOI]

Elisa Gorla

Daniela Mueller

J. Symb. Comput., 2022

Shorter quantum circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

One-way functions and malleability oracles: Hidden shift attacks on isogeny-based protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

SHealS and HealS: isogeny-based PKEs from akey validation method for SIDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

A New Adaptive Attack on SIDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

InSIDH: a Simplification of SiGamal.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of an oblivious PRF from supersingular isogenies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

New results on quasi-subfield polynomials.

[BibT_eX]

[DOI]

Marie Euler

Finite Fields Their Appl., 2021

SimS: A Simplification of SiGamal.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Improved Torsion-Point Attacks on SIDH Variants.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Séta: Supersingular Encryption from Torsion Attacks.

[BibT_eX]

[DOI]

Luca De Feo

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems.

[BibT_eX]

[DOI]

Steven D. Galbraith

J. Cryptol., 2020

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2020

Weak instances of SIDH variants under improved torsion-point attacks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Stronger bounds on the cost of computing Groebner bases for HFE systems.

[BibT_eX]

[DOI]

Elisa Gorla

Daniela Müller

IACR Cryptol. ePrint Arch., 2020

On Index Calculus Algorithms for Subfield Curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

SQISign: compact post-quantum signatures from quaternions and isogenies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

On Adaptive Attacks against Jao-Urbanik's Isogeny-Based Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT.

[BibT_eX]

[DOI]

Emmanuela Orsini

Nigel P. Smart

Proceedings of the Cryptology and Network Security - 19th International Conference, 2020

2019

Another look at some isogeny hardness assumptions.

[BibT_eX]

[DOI]

Simon-Philipp Merz

Romy M. Minko

IACR Cryptol. ePrint Arch., 2019

Trapdoor DDH groups from pairings and isogenies.

[BibT_eX]

[DOI]

Péter Kutas

IACR Cryptol. ePrint Arch., 2019

SÉTA: Supersingular Encryption from Torsion Attacks.

[BibT_eX]

[DOI]

Péter Kutas

IACR Cryptol. ePrint Arch., 2019

Verifiable Delay Functions from Supersingular Isogenies and Pairings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Expanding the use of quasi-subfield polynomials.

[BibT_eX]

[DOI]

Marie Euler

CoRR, 2019

Factoring Products of Braids via Garside Normal Form.

[BibT_eX]

[DOI]

Simon-Philipp Merz

Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Supersingular isogeny graphs in cryptography.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018

Better path-finding algorithms in LPS Ramanujan graphs.

[BibT_eX]

[DOI]

Eduardo Carvalho Pinto

J. Math. Cryptol., 2018

On the (non) obfuscating power of Garside Normal Forms.

[BibT_eX]

[DOI]

Simon-Philipp Merz

IACR Cryptol. ePrint Arch., 2018

Secure Oblivious Transfer from Semi-Commutative Masking.

[BibT_eX]

[DOI]

Emmanuela Orsini

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2018

Supersingular isogeny graphs and endomorphism rings: reductions and solutions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

A Practical Cryptanalysis of WalnutDSA TM.

[BibT_eX]

[DOI]

Daniel Hart

Dohoon Kim

Giacomo Micheli

Guillermo Pascual-Perez

Yuxuan Quek

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017

Full Cryptanalysis of Hash Functions Based on Cubic Ramanujan Graphs.

[BibT_eX]

[DOI]

Hyungrok Jo

Tsuyoshi Takagi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Hard and Easy Problems for Supersingular Isogeny Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Faster Algorithms for Isogeny Problems using Torsion Point Images.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

A Practical Cryptanalysis of WalnutDSA.

[BibT_eX]

[DOI]

Daniel Hart

Dohoon Kim

Giacomo Micheli

Guillermo Pascual-Perez

Yuxuan Quek

IACR Cryptol. ePrint Arch., 2017

2016

On the Security of Supersingular Isogeny Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Signature Schemes Based On Supersingular Isogeny Problems.

[BibT_eX]

[DOI]

Steven D. Galbraith

IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

A Generalised Successive Resultants Algorithm.

[BibT_eX]

[DOI]

James H. Davenport

Benjamin Pring

Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields.

[BibT_eX]

[DOI]

Michiel Kosters

Ange Messeng

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Cryptographic Hash Functions and Expander Graphs: The End of the Story?

[BibT_eX]

[DOI]

Proceedings of the New Codebreakers, 2016

2015

On Generalized First Fall Degree Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Short Accountable Ring Signatures Based on DDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Deterministic root finding in finite fields.

[BibT_eX]

[DOI]

Luca De Feo

Michaël Quisquater

ACM Commun. Comput. Algebra, 2015

2014

On the quaternion -isogeny path problem.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2014

Finding roots in with the successive resultants algorithm.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2014

Finding Roots in GF(p<sup>n</sup>) with the Successive Resultant Algorithm.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

On the quaternion ℓ-isogeny path problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

First fall degree and Weil descent.

[BibT_eX]

[DOI]

Timothy J. Hodges

Jacob Schlather

Finite Fields Their Appl., 2014

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

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Improvement of Faugère et al.'s Method to Solve ECDLP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2013

2012

On Polynomial Systems Arising from a Weil Descent.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders.

[BibT_eX]

[DOI]

Nicolas Veyrat-Charvillon

Proceedings of the Cryptography and Security: From Theory to Applications, 2012

2011

Cayley Hash Functions.

[BibT_eX]

[DOI]

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

Rubik's for cryptographers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

New Subexponential Algorithms for Factoring in SL(2, fq).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Fresh Re-keying II: Securing Multiple Parties against Side-Channel and Fault Attacks.

[BibT_eX]

[DOI]

Proceedings of the Smart Card Research and Advanced Applications, 2011

2010

Preimages for the Tillich-Zémor Hash Function.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

One-Time Trapdoor One-Way Functions.

[BibT_eX]

[DOI]

Julien Cathalo

Proceedings of the Information Security - 13th International Conference, 2010

2009

On graph-based cryptographic hash functions.

[BibT_eX]

[DOI]

PhD thesis, 2009

Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?

[BibT_eX]

[DOI]

Giacomo de Meulenaer

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.

[BibT_eX]

[DOI]

Jean-Pierre Tillich

Gilles Zémor

Proceedings of the Topics in Cryptology, 2009

2008

Full Cryptanalysis of LPS and Morgenstern Hash Function.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Full Cryptanalysis of LPS and Morgenstern Hash Functions.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Nicolas Veyrat-Charvillon

Proceedings of the 15th IEEE International Conference on Electronics, Circuits and Systems, 2008

Fault Attacks on Public Key Elements: Application to DLP-Based Schemes.

[BibT_eX]

[DOI]

Chong Hee Kim

Philippe Bulens

Proceedings of the Public Key Infrastructure, 2008

A block cipher based pseudo random number generator secure against side-channel key recovery.

[BibT_eX]

[DOI]

Olivier Pereira

Tal Malkin

Moti Yung

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.

[BibT_eX]

[DOI]