References of "Coron, Jean-Sébastien 50001378"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSimultaneous Diagonalization of Incomplete Matrices and Applications
Coron, Jean-Sébastien UL; Notarnicola, Luca UL; Wiese, Gabor UL

Scientific journal (in press)

We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices ... [more ▼]

We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices of low rank. We devise practical algorithms for this problem depending on the ranks of P and Q. This problem finds its motivation in cryptanalysis: we show how to significantly improve previous algorithms for solving the approximate common divisor problem and breaking CLT13 cryptographic multilinear maps. [less ▲]

Detailed reference viewed: 60 (2 UL)
Full Text
Peer Reviewed
See detailCryptanalysis of CLT13 Multilinear Maps with Independent Slots
Coron, Jean-Sébastien UL; Notarnicola, Luca UL

in Advances in Cryptology – ASIACRYPT 2019, 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II (2019, December)

Detailed reference viewed: 163 (9 UL)
Full Text
Peer Reviewed
See detailImproved Cryptanalysis of the AJPS Mersenne Based Cryptosystem
Coron, Jean-Sébastien UL; Gini, Agnese UL

in Journal of Mathematical Cryptology (2019)

At Crypto 2018, Aggarwal, Joux, Prakash and Santha (AJPS) described a new public-key encryption scheme based on Mersenne numbers. Shortly after the publication of the cryptosystem, Beunardeau et al ... [more ▼]

At Crypto 2018, Aggarwal, Joux, Prakash and Santha (AJPS) described a new public-key encryption scheme based on Mersenne numbers. Shortly after the publication of the cryptosystem, Beunardeau et al. described an attack with complexity O(2^(2h)). In this paper, we describe an improvedattack with complexity O(2^(1.75h)) . [less ▲]

Detailed reference viewed: 27 (8 UL)
Full Text
Peer Reviewed
See detailOn Kilian's Randomization of Multilinear Map Encodings
Coron, Jean-Sébastien UL; Pereira, Vitor UL

in Coron, Jean-Sébastien; Pereira, Vitor (Eds.) On Kilian's Randomization of Multilinear Map Encodings (2019)

Detailed reference viewed: 42 (11 UL)
Full Text
Peer Reviewed
See detailHigh-Order Conversion from Boolean to Arithmetic Masking
Coron, Jean-Sébastien UL

in Proceedings of CHES 2017 (2017, September)

Detailed reference viewed: 145 (17 UL)
Full Text
Peer Reviewed
See detailZeroizing Attacks on Indistinguishability Obfuscation over CLT13
Coron, Jean-Sébastien UL; Lee, Moon Sung; Lepoint, Tancrede et al

in Proceedings of PKC 2017 (2017)

Detailed reference viewed: 115 (18 UL)
Full Text
Peer Reviewed
See detailHorizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme
Coron, Jean-Sébastien UL; Battistello, Alberto; Prouff, Emmanuel et al

in Proceedings of CHES 2016 (2016)

Detailed reference viewed: 119 (0 UL)
Full Text
Peer Reviewed
See detailCryptanalysis of GGH15 Multilinear Maps
Coron, Jean-Sébastien UL; Lee, Moon Sung; Lepoint, Tancrede et al

in Proceedings of Crypto 2016 (2016)

Detailed reference viewed: 134 (2 UL)
Full Text
Peer Reviewed
See detailFaster Evaluation of SBoxes via Common Shares
Coron, Jean-Sébastien UL; Greuet, Aurelien; Prouff, Emmanuel et al

in Proceedings of CHES 2016 (2016)

Detailed reference viewed: 96 (2 UL)
Full Text
Peer Reviewed
See detailNew Multilinear Maps over the Integers
Coron, Jean-Sébastien UL; Lepoint, Tancrede; Tibouchi, Mehdi

in Proceedings of Crypto 2015 (2015)

Detailed reference viewed: 130 (15 UL)
Full Text
Peer Reviewed
See detailZeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations
Coron, Jean-Sébastien UL

in Proceedings of Crypto 2015 (2015)

Detailed reference viewed: 120 (4 UL)
Full Text
Peer Reviewed
See detailConversion from Arithmetic to Boolean Masking with Logarithmic Complexity
Coron, Jean-Sébastien UL; Groszschädl, Johann UL; Tibouchi, Mehdi et al

in Leander, Gregor (Ed.) Fast Software Encryption, 22nd International Workshop, FSE 2015, Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers (2015, March)

A general technique to protect a cryptographic algorithm against side-channel attacks consists in masking all intermediate variables with a random value. For cryptographic algorithms combining Boolean ... [more ▼]

A general technique to protect a cryptographic algorithm against side-channel attacks consists in masking all intermediate variables with a random value. For cryptographic algorithms combining Boolean operations with arithmetic operations, one must then perform conversions between Boolean masking and arithmetic masking. At CHES 2001, Goubin described a very elegant algorithm for converting from Boolean masking to arithmetic masking, with only a constant number of operations. Goubin also described an algorithm for converting from arithmetic to Boolean masking, but with O(k) operations where k is the addition bit size. In this paper we describe an improved algorithm with time complexity O(log k) only. Our new algorithm is based on the Kogge-Stone carry look-ahead adder, which computes the carry signal in O(log k) instead of O(k) for the classical ripple carry adder. We also describe an algorithm for performing arithmetic addition modulo 2^k directly on Boolean shares, with the same complexity O(log k) instead of O(k). We prove the security of our new algorithm against first-order attacks. Our algorithm performs well in practice, as for k=64 we obtain a 23% improvement compared to Goubin’s algorithm. [less ▲]

Detailed reference viewed: 206 (8 UL)
Full Text
Peer Reviewed
See detailSecure Conversion between Boolean and Arithmetic Masking of Any Order
Coron, Jean-Sébastien UL; Groszschädl, Johann UL; Vadnala, Praveen Kumar UL

in Batina, Lejla; Robshaw, Matthew (Eds.) Cryptographic Hardware and Embedded Systems - CHES 2014, 16th International Workshop, Busan, South Korea, September 23-26, 2014. Proceedings (2014, September)

Detailed reference viewed: 158 (12 UL)
Full Text
Peer Reviewed
See detailHigher Order Masking of Look-Up Tables
Coron, Jean-Sébastien UL

in Proceedings of Eurocrypt 2014 (2014)

Detailed reference viewed: 94 (1 UL)
Full Text
Peer Reviewed
See detailFast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
Coron, Jean-Sébastien UL; Roy, Arnab; Venkatesh, Srinivas Vivek UL

in Batina, Lejla; Robshaw, Matthew (Eds.) Cryptographic Hardware and Embedded Systems – CHES 2014 (2014)

We describe a new technique for evaluating polynomials over binary finite fields. This is useful in the context of anti-DPA countermeasures when an S-box is expressed as a polynomial over a binary finite ... [more ▼]

We describe a new technique for evaluating polynomials over binary finite fields. This is useful in the context of anti-DPA countermeasures when an S-box is expressed as a polynomial over a binary finite field. For n-bit S-boxes our new technique has heuristic complexity ${\cal O}(2^{n/2}/\sqrt{n})$ instead of ${\cal O}(2^{n/2})$ proven complexity for the Parity-Split method. We also prove a lower bound of ${\Omega}(2^{n/2}/\sqrt{n})$ on the complexity of any method to evaluate $n$-bit S-boxes; this shows that our method is asymptotically optimal. Here, complexity refers to the number of non-linear multiplications required to evaluate the polynomial corresponding to an S-box. In practice we can evaluate any 8-bit S-box in 10 non-linear multiplications instead of 16 in the Roy-Vivek paper from CHES 2013, and the DES S-boxes in 4 non-linear multiplications instead of 7. We also evaluate any 4-bit S-box in 2 non-linear multiplications instead of 3. Hence our method achieves optimal complexity for the PRESENT S-box. [less ▲]

Detailed reference viewed: 149 (6 UL)
Full Text
Peer Reviewed
See detailA Note on the Bivariate Coppersmith Theorem
Coron, Jean-Sébastien UL; Kirichenko, Alexey; Tibouchi, Mehdi UL

in Journal of Cryptology (2013), 26(2), 246-250

Detailed reference viewed: 103 (2 UL)
Full Text
Peer Reviewed
See detailBatch Fully Homomorphic Encryption over the Integers
Cheon, Jung Hee; Coron, Jean-Sébastien UL; Kim, Jinsu et al

in EUROCRYPT (2013)

Detailed reference viewed: 151 (0 UL)