Jean-Sébastien Coron

Affiliations:
  • University of Luxembourg


According to our database1, Jean-Sébastien Coron authored at least 113 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Improved Gadgets for the High-Order Masking of Dilithium.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

High-order masking of NTRU.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

High-order Polynomial Comparison and Masking Lattice-based Encryption.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

2022
High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

2021
Secure Shuffling in the Probing Model.
IACR Cryptol. ePrint Arch., 2021

Provably Solving the Hidden Subset Sum Problem via Statistical Learning.
IACR Cryptol. ePrint Arch., 2021

Secure Wire Shuffling in the Probing Model.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Simultaneous Diagonalization of Incomplete Matrices and Applications.
IACR Cryptol. ePrint Arch., 2020

A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem.
IACR Cryptol. ePrint Arch., 2020

Random Probing Security: Verification, Composition, Expansion and New Constructions.
IACR Cryptol. ePrint Arch., 2020

2019
Cryptanalysis of CLT13 Multilinear Maps with Independent Slots.
IACR Cryptol. ePrint Arch., 2019

Side-channel Masking with Pseudo-Random Generator.
IACR Cryptol. ePrint Arch., 2019

Improved Cryptanalysis of the AJPS Mersenne Based Cryptosystem.
IACR Cryptol. ePrint Arch., 2019

2018
High Order Masking of Look-up Tables with Common Shares.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Improved High-Order Conversion From Boolean to Arithmetic Masking.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

On Kilian's Randomization of Multilinear Map Encodings.
IACR Cryptol. ePrint Arch., 2018

Improved Factorization of N=p^rq^s.
Proceedings of the Topics in Cryptology - CT-RSA 2018, 2018

2017
Formal Verification of Side-channel Countermeasures via Elementary Circuit Transformations.
IACR Cryptol. ePrint Arch., 2017

High-Order Conversion From Boolean to Arithmetic Masking.
IACR Cryptol. ePrint Arch., 2017

2016
Practical Cryptanalysis of ISO 9796-2 and EMV Signatures.
J. Cryptol., 2016

How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.
J. Cryptol., 2016

Improved Factorization of N=p<sup>rq<sup>s</sup></sup>.
IACR Cryptol. ePrint Arch., 2016

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13.
IACR Cryptol. ePrint Arch., 2016

Faster Evaluation of SBoxes via Common Shares.
IACR Cryptol. ePrint Arch., 2016

Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme.
IACR Cryptol. ePrint Arch., 2016

Factoring N=p^rq^s for Large r and s.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Cryptanalysis of GGH15 Multilinear Maps.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Security Analysis of the Modular Enhanced Symmetric Role Authentication (mERA) Protocol.
Proceedings of the New Codebreakers, 2016

2015
Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures.
J. Cryptogr. Eng., 2015

Higher-Order Side Channel Security and Mask Refreshing.
IACR Cryptol. ePrint Arch., 2015

New Multilinear Maps over the Integers.
IACR Cryptol. ePrint Arch., 2015

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations.
IACR Cryptol. ePrint Arch., 2015

Factoring N=p<sup>r</sup> q<sup>s</sup> for Large r and s.
IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of GGH15 Multilinear Maps.
IACR Cryptol. ePrint Arch., 2015

Improved Side-Channel Analysis of Finite-Field Multiplication.
IACR Cryptol. ePrint Arch., 2015

A Number-Theoretic Error-Correcting Code.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2015

2014
Introduction to the CHES 2013 special issue.
J. Cryptogr. Eng., 2014

Cryptanalysis of Two Candidate Fixes of Multilinear Maps over the Integers.
IACR Cryptol. ePrint Arch., 2014

Scale-Invariant Fully Homomorphic Encryption over the Integers.
IACR Cryptol. ePrint Arch., 2014

Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity.
IACR Cryptol. ePrint Arch., 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptol. ePrint Arch., 2014

Secure Conversion between Boolean and Arithmetic Masking of Any Order.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

2013
A Note on the Bivariate Coppersmith Theorem.
J. Cryptol., 2013

Practical Multilinear Maps over the Integers.
IACR Cryptol. ePrint Arch., 2013

Batch Fully Homomorphic Encryption over the Integers.
IACR Cryptol. ePrint Arch., 2013

A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search.
IACR Cryptol. ePrint Arch., 2013

Higher Order Masking of Look-up Tables.
IACR Cryptol. ePrint Arch., 2013

Batch Fully Homomorphic Encryption over the Integers.
Proceedings of the Advances in Cryptology, 2013

2012
Another Look at Affine-Padding RSA Signatures.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Conversion of Security Proofs from One Leakage Model to Another: A New Issue.
Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2012

On the Use of Shamir's Secret Sharing against Side-Channel Analysis.
Proceedings of the Smart Card Research and Advanced Applications, 2012

2011
Optimization of Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2011

Another Look at RSA Signatures With Affine Padding.
IACR Cryptol. ePrint Arch., 2011

Fully Homomorphic Encryption over the Integers with Shorter Public Keys.
IACR Cryptol. ePrint Arch., 2011

Supplemental Access Control (PACE v2): Security Analysis of PACE Integrated Mapping.
IACR Cryptol. ePrint Arch., 2011

Improved Generic Algorithms for Hard Knapsacks.
IACR Cryptol. ePrint Arch., 2011

2010
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005.
IACR Cryptol. ePrint Arch., 2010

On The Broadcast and Validity-Checking Security of PKCS \#1 v1.5 Encryption.
IACR Cryptol. ePrint Arch., 2010

Fault Attacks and Countermeasures on Vigilant's RSA-CRT Algorithm.
Proceedings of the 2010 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2010

SPAKE: A Single-Party Public-Key Authenticated Key Exchange Protocol for Contact-Less Applications.
Proceedings of the Financial Cryptography and Data Security, 2010

Analysis and Improvement of the Random Delay Countermeasure of CHES 2009.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2010

2009
Practical Cryptanalysis of ISO/IEC 9796-2 and EMV Signatures.
IACR Cryptol. ePrint Arch., 2009

Fault Attacks Against EMV Signatures.
IACR Cryptol. ePrint Arch., 2009

An Efficient Method for Random Delay Generation in Embedded Software.
IACR Cryptol. ePrint Arch., 2009

Fault Attacks on RSA Signatures with Partially Unknown Messages.
IACR Cryptol. ePrint Arch., 2009

A Domain Extender for the Ideal Cipher.
IACR Cryptol. ePrint Arch., 2009

Efficient Indifferentiable Hashing into Ordinary Elliptic Curves.
IACR Cryptol. ePrint Arch., 2009

A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model.
Des. Codes Cryptogr., 2009

Analysis of the split mask countermeasure for embedded systems.
Proceedings of the 4th Workshop on Embedded Systems Security, 2009

PSS Is Secure against Random Fault Attacks.
Proceedings of the Advances in Cryptology, 2009

2008
Cryptanalysis of ISO/IEC 9796-1.
J. Cryptol., 2008

The Random Oracle Model and the Ideal Cipher Model are Equivalent.
IACR Cryptol. ePrint Arch., 2008

A New DPA Countermeasure Based on Permutation Tables.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

2007
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring.
J. Cryptol., 2007

Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach.
Proceedings of the Advances in Cryptology, 2007

Side Channel Cryptanalysis of a Higher Order Masking Scheme.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2007

On the Implementation of a Fast Prime Generation Algorithm.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2007

2006
What Is Cryptography?
IEEE Secur. Priv., 2006

Index Calculation Attacks on RSA Signature and Encryption.
Des. Codes Cryptogr., 2006

2005
Secure Delegation of Elliptic-Curve Pairing.
IACR Cryptol. ePrint Arch., 2005

From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited.
Proceedings of the Public Key Cryptography, 2005

Merkle-Damgård Revisited: How to Construct a Hash Function.
Proceedings of the Advances in Cryptology, 2005

A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004
Statistics and secret leakage.
ACM Trans. Embed. Comput. Syst., 2004

Cryptanalysis of a Provably Secure Cryptographic Hash Function.
IACR Cryptol. ePrint Arch., 2004

Externalized Fingerprint Matching.
IACR Cryptol. ePrint Arch., 2004

Finding Small Roots of Bivariate Integer Polynomial Equations Revisited.
Proceedings of the Advances in Cryptology, 2004

Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt '95.
Proceedings of the Topics in Cryptology, 2004

2003
Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem.
IACR Cryptol. ePrint Arch., 2003

Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem.
IACR Cryptol. ePrint Arch., 2003

A New Algorithm for Switching from Arithmetic to Boolean Masking.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
Universal Padding Schemes for RSA.
IACR Cryptol. ePrint Arch., 2002

Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages.
IACR Cryptol. ePrint Arch., 2002

GEM: A Generic Chosen-Ciphertext Secure Encryption Method.
Proceedings of the Topics in Cryptology, 2002

Security Proof for Partial-Domain Hash Signature Schemes.
Proceedings of the Advances in Cryptology, 2002

2001
Optimal security proofs for PSS and other signature schemes.
IACR Cryptol. ePrint Arch., 2001

Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Cryptanalysis of RSA Signatures with Fixed-Pattern Padding.
Proceedings of the Advances in Cryptology, 2001

2000
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme.
Proceedings of the Advances in Cryptology, 2000

New Attacks on PKCS#1 v1.5 Encryption.
Proceedings of the Advances in Cryptology, 2000

On the Exact Security of Full Domain Hash.
Proceedings of the Advances in Cryptology, 2000

On Boolean and Arithmetic Masking against Differential Power Analysis.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

Differential Power Analysis in the Presence of Hardware Countermeasures.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

From Fixed-Length to Arbitrary-Length RSA Padding Schemes.
Proceedings of the Advances in Cryptology, 2000

1999
On the Security of RSA Screening.
Proceedings of the Public Key Cryptography, 1999

On the Security of Random Sources.
Proceedings of the Public Key Cryptography, 1999

On the Security of RSA Padding.
Proceedings of the Advances in Cryptology, 1999

Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems.
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

ECC: Do We Need to Count?
Proceedings of the Advances in Cryptology, 1999

1998
An Accurate Evaluation of Maurer's Universal Test.
Proceedings of the Selected Areas in Cryptography '98, 1998


  Loading...