A polynomial time key-recovery attack on the Sidon cryptosystem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

A polynomial time key-recovery attack on the Sidon cryptosystem

Résumé

The Sidon cryptosystem [22] is a new multivariate encryption scheme based on the theory of Sidon spaces which was presented at PKC 2021. As is usual for this kind of schemes, its security relies on the hardness of solving particular instances of the MQ problem and of the MinRank problem. A nice feature of the scheme is that it enjoys a homomorphic property due the bilinearity of its public polynomials. Unfortunately, we will show that the Sidon cryptosystem can be broken by a polynomial time key-recovery attack. This attack relies on the existence of solutions to the underlying MinRank instance which lie in a subfield and which are inherent to the structure of the secret Sidon space. We prove that such solutions can be found in polynomial time. Our attack consists in recovering an equivalent key for the cryptosystem by exploiting these particular solutions, and this task can be performed very efficiently.
Fichier principal
Vignette du fichier
2021-929.pdf (416.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03533464 , version 1 (18-01-2022)

Licence

Paternité

Identifiants

Citer

Pierre Briaud, Jean-Pierre Tillich, Javier Verbel. A polynomial time key-recovery attack on the Sidon cryptosystem. SAC 2021 - Selected Areas in Cryptography, Sep 2021, Victoria, Canada. pp.419-438, ⟨10.1007/978-3-030-99277-4_20⟩. ⟨hal-03533464⟩
51 Consultations
46 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More