| The first collision for full SHA-1 M Stevens, E Bursztein, P Karpman, A Albertini, Y Markov IACR ePrint, 2017 | 527 | 2017 |
| Freestart collision for full SHA-1 M Stevens, P Karpman, T Peyrin Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 101 | 2016 |
| Efficient and provable white-box primitives PA Fouque, P Karpman, P Kirchner, B Minaud International Conference on the Theory and Application of Cryptology and …, 2016 | 68 | 2016 |
| Key-Recovery Attacks on ASASA B Minaud, P Derbez, PA Fouque, P Karpman Advances in Cryptology–ASIACRYPT 2015, 3-27, 2015 | 63 | 2015 |
| Practical free-start collision attacks on 76-step SHA-1 P Karpman, T Peyrin, M Stevens Advances in Cryptology–CRYPTO 2015, 623-642, 2015 | 40 | 2015 |
| Analysis of BLAKE2 J Guo, P Karpman, I Nikolić, L Wang, S Wu Topics in Cryptology–CT-RSA 2014: The Cryptographer’s Track at the RSA …, 2014 | 39 | 2014 |
| Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE T Espitau, PA Fouque, P Karpman Advances in Cryptology–CRYPTO 2015, 683-701, 2015 | 20 | 2015 |
| The LITTLUN S-box and the FLY block cipher P Karpman, B Grégoire Lightweight Cryptography Workshop, 2016 | 16 | 2016 |
| Fast verification of masking schemes in characteristic two N Bordes, P Karpman Annual International Conference on the Theory and Applications of …, 2021 | 12 | 2021 |
| New instantiations of the CRYPTO 2017 masking schemes P Karpman, DS Roche International Conference on the Theory and Application of Cryptology and …, 2018 | 12 | 2018 |
| Short non-malleable codes from related-key secure block ciphers S Fehr, P Karpman, B Mennink Cryptology ePrint Archive, 2018 | 9 | 2018 |
| From distinguishers to key recovery: Improved related-key attacks on Even-Mansour P Karpman International Conference on Information Security, 177-188, 2015 | 6* | 2015 |
| Security amplification against meet-in-the-middle attacks using whitening PA Fouque, P Karpman Cryptography and Coding: 14th IMA International Conference, IMACC 2013 …, 2013 | 5 | 2013 |
| Time-memory tradeoffs for large-weight syndrome decoding in ternary codes P Karpman, C Lefevre IACR International Conference on Public-Key Cryptography, 82-111, 2022 | 4 | 2022 |
| Analyse de primitives symétriques P Karpman Université Paris Saclay (COmUE); Nanyang Technological University (Singapour), 2016 | 3 | 2016 |
| Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation D Augot, PA Fouque, P Karpman Selected Areas in Cryptography–SAC 2014, 243-260, 2014 | 3 | 2014 |
| Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices P Karpman, C Pernet, H Signargout, G Villard Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021 | 1 | 2021 |
| WAVE G Banegas, K Carrier, A Chailloux, A Couvreur, T Debris-Alazard, ... | | 2023 |
| A short introduction to provable security in symmetric cryptography P Karpman | | 2022 |
| A constant-time sampler for close-to-uniform bitsliced ternary vectors P Karpman | | 2022 |
Marc StevensScientific Researcher, Centrum Wiskunde & InformaticaVerified email at marc-stevens.nl
