%0 Journal Article %T Security Analysis of Word Problem-Based Cryptosystems %+ Unité de Mathématiques Appliquées (UMA) %+ Solvers for Algebraic Systems and Applications (SALSA) %+ Algorithmique, Langage et Information (ALI) %A Levy-Dit-Vehel, Françoise %A Perret, Ludovic %< avec comité de lecture %@ 0925-1022 %J Designs, Codes and Cryptography %I Springer Verlag %V 54 %N 1 %P 29-41 %8 2010-01 %D 2010 %R 10.1007/s10623-009-9307-x %Z Computer Science [cs]/Cryptography and Security [cs.CR]Journal articles %X We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key. %G English %L hal-00974889 %U https://ensta-paris.hal.science/hal-00974889 %~ UPMC %~ ENSTA %~ CNRS %~ INRIA %~ INRIA-ROCQ %~ INRIA_TEST %~ TESTALAIN1 %~ UMA_ENSTA %~ LIP6 %~ INRIA2 %~ UPMC_POLE_1 %~ SORBONNE-UNIVERSITE %~ SU-SCIENCES %~ ALLIANCE-SU