Mathématiques discrètes appliquées à la cryptographie symétrique

Autor: Rotella, Yann

Dans cette thèse, nous étudions la sécurité de primitives cryptographiques. Ces systèmes sont fondés sur des transformations utilisant des objets mathématiques représentés de multiples manières. Nous utilisons alors certaines structures inh

Externí odkaz: http://www.theses.fr/2018SORUS092/document

State-Recovery Attacks on Modified Ketje Jr

Autor: Fuhr, Thomas, Naya-Plasencia, María, Rotella, Yann

Publikováno v: IACR Transactions on Symmetric Cryptology
IACR Transactions on Symmetric Cryptology, 2018, 2018 (1), pp.29-56. ⟨10.13154/tosc.v2018.i1.29-56⟩
IACR Trans. Symmetric Cryptol.
IACR Transactions on Symmetric Cryptology, Ruhr Universität Bochum, 2018, 2018 (1), pp.29-56. ⟨10.13154/tosc.v2018.i1.29-56⟩
IACR Transactions on Symmetric Cryptology, Pp 29-56 (2018)
IACR Transactions on Symmetric Cryptology; Volume 2018, Issue 1; 29-56

In this article we study the security of the authenticated encryption algorithm Ketje against divide-and-conquer attacks. Ketje is a third-round candidate in the ongoing CAESAR competition, which shares most of its design principles with the SHA-3 ha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbcd74909ade4d78b6eb1905f33cd452

Cryptanalysis of MORUS

Autor: Ashur, T., Eichlseder, M., Lauridsen, M.M., Leurent, G., Minaud, B., Rotella, Yann, Sasaki, Yu, Viguier, B.G.P., Peyrin, T., Galbraith, S.D.

Publikováno v: Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, pp. 35-64
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, Australia. pp.35-64, ⟨10.1007/978-3-030-03329-3_2⟩
Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 35-64. Cham : Springer
STARTPAGE=35;ENDPAGE=64;ISSN=0302-9743;TITLE=Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II
Lecture Notes in Computer Science ISBN: 9783030033286
ASIACRYPT (2)

MORUS is a high-performance authenticated encryption algorithm submitted to the CAESAR competition, and recently selected as a finalist. There are three versions of MORUS: MORUS-640 with a 128-bit key, and MORUS-1280 with 128-bit or 256-bit keys. For

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::216f8f3cdef388bbed1caef4fb8d544c
https://hdl.handle.net/2066/200769

Boolean functions with restricted input and their robustness; application to the FLIP cipher

Autor: Carlet, Claude, Méaux, Pierrick, Rotella, Yann

Publikováno v: IACR Transactions on Symmetric Cryptology, Pp 192-227 (2017)
IACR Transactions on Symmetric Cryptology
IACR Transactions on Symmetric Cryptology, Ruhr Universität Bochum, 2017, 2017 (3), pp.192--227. ⟨10.13154/tosc.v2017.i3.192-227⟩
IACR Transactions on Symmetric Cryptology, 2017, 2017 (3), pp.192--227. ⟨10.13154/tosc.v2017.i3.192-227⟩
IACR Transactions on Symmetric Cryptology; Volume 2017, Issue 3; 192-227

We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number n of variables, the input to these functions is restricted to some subset E of 𝔽n2. We study in particular the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b331973164e4cd3ec24863d8199d07e
https://tosc.iacr.org/index.php/ToSC/article/view/771

Proving Resistance against Invariant Attacks: Properties of the Linear Layer

Autor: Beierle, Christof, Canteaut, Anne, Leander, Gregor, Rotella, Yann

Publikováno v: ESC 2017-Early Symmetric Crypto
ESC 2017-Early Symmetric Crypto, Jan 2017, Canach, Luxembourg

International audience; Many lightweight block ciphers use a very simple key-schedule where the round-keys only differ by a round-constant. However, several of those schemes were recently broken using invariant attacks, i.e. invariant subspace attack

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e755bddf709eaeece3671a28a2a2d548
https://hal.inria.fr/hal-01649994/document