An algebraic method for public-key cryptography
type: Item
instance of: scholarly article
title: An algebraic method for public-key cryptography
zbMATH Open document ID: 0944.94012
author: Michael Anshel
author: Dorian Goldfeld
author: Iris Anshel
published in: Mathematical Research Letters
publication date: 2000-08-13T00:00:00Z
review text: A key establishment protocol is a protocol whereby a shared secret becomes available to two or more parties, for subsequent cryptographic applications. The paper describes an algebraic key establishment protocol for secret key establishment between two individuals communicating over a public channel. This protocol is based on feasibly computable monoids and the foundation of the method lies in the difficulty of solving equations over algebraic structures. As an example, a group-theoretic implementation of the protocol is given. Here an adversary observing all communications over the public channel can break the scheme and determine the secret key provided that a system of conjugacy equations over the associated group is feasibly solvable.
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 1489515
zbMATH Keywords: public-key cryptography
zbMATH Keywords: key establishment
zbMATH Keywords: group-theoretic implementation
reviewed by: Karl-Heinz Zimmermann
MaRDI profile type: Publication
full work available at URL: mrl.1999.v6.n3.a3
OpenAlex ID: W1976904648
DOI: 10.4310/MRL.1999.V6.N3.A3
description: scientific article; zbMATH DE number 1489515