Zobrazeno 1 - 10
of 170
pro vyhledávání: '"Perret Ludovic"'
Autor:
Battarbee, Christopher, Striecks, Christoph, Perret, Ludovic, Ramacher, Sebastian, Verhaeghe, Kevin
Authenticated Key Exchange (AKE) between any two entities is one of the most important security protocols available for securing our digital networks and infrastructures. In PQCrypto 2023, Bruckner, Ramacher and Striecks proposed a novel hybrid AKE (
Externí odkaz:
http://arxiv.org/abs/2411.04030
There are many group-based cryptosystems in which the security relies on the difficulty of solving Conjugacy Search Problem (CSP) and Simultaneous Conjugacy Search Problem (SCSP) in their underlying platform groups. In this paper we give a cryptanaly
Externí odkaz:
http://arxiv.org/abs/2309.13928
In this paper, we present a new diverse class of post-quantum group-based Digital Signature Schemes (DSS). The approach is significantly different from previous examples of group-based digital signatures and adopts the framework of group action-based
Externí odkaz:
http://arxiv.org/abs/2304.12900
Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its relationship to more
Externí odkaz:
http://arxiv.org/abs/2209.02814
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous polynomials, that
Externí odkaz:
http://arxiv.org/abs/1810.12588
Autor:
Faug`ere, Jean-Charles, Horan, Kelsey, Kahrobaei, Delaram, Kaplan, Marc, Kashefi, Elham, Perret, Ludovic
In August 2015 the cryptographic world was shaken by a sudden and surprising announcement by the US National Security Agency NSA concerning plans to transition to post-quantum algorithms. Since this announcement post-quantum cryptography has become a
Externí odkaz:
http://arxiv.org/abs/1712.07211
Autor:
Faugère, Jean-Charles, Otmani, Ayoub, Perret, Ludovic, de Portzamparc, Frédéric, Tillich, Jean-Pierre
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such codes dis
Externí odkaz:
http://arxiv.org/abs/1405.5101
Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if any -- an
Externí odkaz:
http://arxiv.org/abs/1307.4974
Autor:
Gligoroski, Danilo, Knapskog, Svein Johan, Markovski, Smile, Ødegård, Rune Steinsmo, Jensen, Rune Erlend, Perret, Ludovic, Faugère, Jean-Charles
This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG - a new public key digital signature scheme. The complete scientific publication covering the design rationale and the security analysis will be g
Externí odkaz:
http://arxiv.org/abs/1010.3163
Publikováno v:
In Journal of Complexity August 2015 31(4):590-616
