Using Semidirect Product of (Semi)groups in Public Key Cryptography

DOI10.1007/978-3-319-40189-8_14MaRDI QIDQ3188249zbMATH OpenOpenAlexFDO

Authors Delaram Kahrobaei, Vladimir Shpilrain

Publication date 17 August 2016

Published in Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.05542

Mathematics Subject Classification ID

Extensions, wreath products, and other compositions of groups (20E22) Cryptography (94A60)

Abstract: In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This protocol can be based on any group or semigroup, in particular on any non-commutative group. One of its special cases is the standard Diffie-Hellman protocol, which is based on a cyclic group. However, when this protocol is used with a non-commutative (semi)group, it acquires several useful features that make it compare favorably to the Diffie-Hellman protocol. The focus then shifts to selecting an optimal platform (semi)group, in terms of security and efficiency. We show, in particular, that one can get a variety of new security assumptions by varying an automorphism used for a (semi)group extension.

Recommendations

• Public key exchange using semidirect product of (semi)groups
• Public key cryptography using semigroup actions and semirings
• Public key cryptography based on semigroup actions
• scientific article; zbMATH DE number 2156406
• Public key cryptography based on semimodules over quotient semirings
• Non-commutative finite groups as primitive of public key cryptosystems
• scientific article; zbMATH DE number 2102392
• Constructions in public-key cryptography over matrix groups
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
• Properties of certain semigroups and their potential as platforms for cryptosystems

Cites work

• A linear decomposition attack
• Cryptanalysis of Stickel’s Key Exchange Scheme
• Faithful representations of p-groups at characteristic p. I
• Group-based cryptography
• scientific article; zbMATH DE number 5982274 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1842507 (Why is no real title available?)
• Key agreement, the Algebraic Eraser\(^{\text{TM}}\) and lightweight cryptography
• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• New directions in cryptography
• Public key exchange using matrices over group rings
• Public key exchange using semidirect product of (semi)groups

Cited in

(26)

• Delegating a product of group exponentiations with application to signature schemes
• MAKE: a matrix action key exchange
• Two general schemes of algebraic cryptography
• Public key cryptography based on semigroup actions
• On the efficiency of a general attack against the MOBS cryptosystem
• Public key exchange using semidirect product of (semi)groups
• A group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
• Application of non-associative structures to the construction of public key distribution algorithms
• A nonlinear decomposition attack
• Group key management based on semigroup actions
• Algorithmic problems in Engel groups and cryptographic applications
• scientific article; zbMATH DE number 7300652 (Why is no real title available?)
• Tropical cryptography II: Extensions by homomorphisms
• Public key cryptography based on semimodules over quotient semirings
• Properties of certain semigroups and their potential as platforms for cryptosystems
• A construction of encryption protocols over some semidirect products
• SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
• Semidirect product key exchange: the state of play
• MOBS: matrices over bit strings public key exchange
• Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
• Tropical cryptography. III: Digital signatures
• On the semidirect discrete logarithm problem in finite groups
• A small serving of mash: (quantum) algorithms for SPDH-sign with small parameters
• A subexponential quantum algorithm for the semidirect discrete logarithm problem
• Cryptanalysis of semidirect product key exchange using matrices over non-commutative rings

This page was built for publication: Using Semidirect Product of (Semi)groups in Public Key Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188249)