This paper shows that an eavesdropper can always recover efficiently the private key of one of the two parts of the public key cryptography protocol introduced by Shpilrain and Ushakov (ACNS 2005, Lecture Notes in Comput. Sci., vol. 3531, pp. 151-163, 2005). Thus an eavesdropper can always recover the shared secret key, making the protocol insecure. © 2007 International Association for Cryptologic Research.

Matucci, F. (2008). Cryptanalysis of the shpilrain-ushakov protocol for Thompson's group. JOURNAL OF CRYPTOLOGY, 21(3), 458-468 [10.1007/s00145-007-9016-4].

Cryptanalysis of the shpilrain-ushakov protocol for Thompson's group

MATUCCI, FRANCESCO
2008

Abstract

This paper shows that an eavesdropper can always recover efficiently the private key of one of the two parts of the public key cryptography protocol introduced by Shpilrain and Ushakov (ACNS 2005, Lecture Notes in Comput. Sci., vol. 3531, pp. 151-163, 2005). Thus an eavesdropper can always recover the shared secret key, making the protocol insecure. © 2007 International Association for Cryptologic Research.
Articolo in rivista - Articolo scientifico
Conjugacy problem; Decomposition problem; Infinite groups; Normal form; Piecewise-linear homeomorphism;
English
2008
21
3
458
468
open
Matucci, F. (2008). Cryptanalysis of the shpilrain-ushakov protocol for Thompson's group. JOURNAL OF CRYPTOLOGY, 21(3), 458-468 [10.1007/s00145-007-9016-4].
File in questo prodotto:
File Dimensione Formato  
thompson-crypto-break5.pdf

accesso aperto

Tipologia di allegato: Author’s Accepted Manuscript, AAM (Post-print)
Dimensione 215.97 kB
Formato Adobe PDF
215.97 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/214402
Citazioni
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 3
Social impact