Designs, Codes and Cryptography

, Volume 32, Issue 1–3, pp 207–216

On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups

  • M. I. González Vasco
  • D. Hofheinz
  • C. Martínez
  • R. Steinwandt
Article
  • 67 Downloads

Abstract

The security of two public key encryption schemes relying on the hardness of different computational problems in non-abelian groups is investigated. First, an attack on a conceptual public key scheme based on Grigorchuk groups is presented. We show that from the public data one can easily derive an “equivalent” secret key that allows the decryption of arbitrary messages encrypted under the public key. Hereafter, a security problem in another conceptual public key scheme based on non-abelian groups is pointed out. We show that in the present form the BMW scheme is vulnerable to an attack, which can recover large parts of the private subgroup chain from the public key.

public key encryption non-abelian groups word problem logarithmic signatures 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • M. I. González Vasco
    • 1
  • D. Hofheinz
    • 2
  • C. Martínez
    • 1
  • R. Steinwandt
    • 2
  1. 1.Spain
  2. 2.Institut für Algorithmen und Kognitive Systeme, Arbeitsgruppe Systemsicherheit, Th. BethUniversität KarlsruheKarlsruheGermany

Personalised recommendations