An algebraic method for public-key cryptography (Q1574733)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1489515
Language Label Description Also known as
default for all languages
No label defined
    English
    An algebraic method for public-key cryptography
    scientific article; zbMATH DE number 1489515

      Statements

      An algebraic method for public-key cryptography (English)
      0 references
      0 references
      0 references
      0 references
      13 August 2000
      0 references
      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.
      0 references
      public-key cryptography
      0 references
      key establishment
      0 references
      group-theoretic implementation
      0 references

      Identifiers