The MOR cryptosystem and finite p-groups

zbMATH Open1345.94080arXiv1309.1859MaRDI QIDQ2944017FDOQ2944017

Authors: Ayan Mahalanobis 

Publication date: 7 September 2015

Abstract: The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar cryptosystem. It uses the discrete logarithm problem in the automorphism group as the cryptographic primitive. In this paper, we study the MOR cryptosystem for finite $p$-groups. The study is complete for $p^{p}rime$-automorphisms. For $p$-automorphisms there are some interesting open problems.

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

Recommendations

• A simple generalization of the ElGamal cryptosystem to non-abelian groups. II
• The MOR cryptosystem and extra-special \(p\)-groups
• On the Security of MOR Public Key Cryptosystem
• A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
• Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups

zbMATH Keywords

discrete logarithm problemfinite \(p\)-groupsMOR cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Finite nilpotent groups, (p)-groups (20D15)

Cited In (8)

• A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
• Title not available (Why is that?)
• Public key protocols over the ring \(E_{p}^{(m)}\)
• On the Security of MOR Public Key Cryptosystem
• Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups
• A simple generalization of the ElGamal cryptosystem to non-abelian groups. II
• The MOR cryptosystem and extra-special \(p\)-groups
• Automorphisms of types and their applications

This page was built for publication: The MOR cryptosystem and finite \(p\)-groups

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