Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bros, Maxime"'
Autor:
Bajcsy, Peter, Bros, Maxime
This work addresses the problem of planting and defending cryptographic-based backdoors in artificial intelligence (AI) models. The motivation comes from our lack of understanding and the implications of using cryptographic techniques for planting un
Externí odkaz:
http://arxiv.org/abs/2405.13217
The Rank Decoding problem (RD) is at the core of rank-based cryptography. This problem can also be seen as a structured version of MinRank, which is ubiquitous in multivariate cryptography. Recently, \cite{BBBGNRT20,BBCGPSTV20} proposed attacks based
Externí odkaz:
http://arxiv.org/abs/2208.05471
We propose two main contributions: first, we revisit the encryption scheme Rank Quasi-Cyclic (RQC) by introducing new efficient variations, in particular, a new class of codes, the Augmented Gabidulin codes; second, we propose new attacks against the
Externí odkaz:
http://arxiv.org/abs/2207.01410
Autor:
Bardet, Magali, Bros, Maxime, Cabarcas, Daniel, Gaborit, Philippe, Perlner, Ray, Smith-Tone, Daniel, Tillich, Jean-Pierre, Verbel, Javier
Rank Decoding (RD) is the main underlying problem in rank-based cryptography. Based on this problem and quasi-cyclic versions of it, very efficient schemes have been proposed recently, such as those in the ROLLO and RQC submissions, which have reache
Externí odkaz:
http://arxiv.org/abs/2002.08322
Autor:
Bardet, Magali, Briaud, Pierre, Bros, Maxime, Gaborit, Philippe, Neiger, Vincent, Ruatta, Olivier, Tillich, Jean-Pierre
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic versions of it have been proposed recently, such as those in the submissio
Externí odkaz:
http://arxiv.org/abs/1910.00810
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.