References of "Tibouchi, Mehdi"
     in
Bookmark and Share    
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: 62 (18 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: 57 (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: 75 (6 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: 128 (7 UL)