A simple generalization of El-Gamal cryptosystem to non-abelian groups
Ayan Mahalanobis
Abstract
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equivalent to the El-Gamal cryptosystem over finite fields.
Create a lesson
Related papers
Attesting Outputs and Delegation Ancestry in Multi-Agent AI Systems
Lifei Liu, Haoran Yu
Using Hyper-V Sockets for Real-time Data Extraction from a Malware Analysis Sandbox
István-Attila Császár, Radu-Marian Portase, Adrian Coleşa et al.
KORD: Breaking the Key-Generation Bottleneck in Dealerless FSS via Protocol--Hardware Co-Design
Yijing Peng, Lin Liu, Yujie Xue et al.
A Roadmap to Available ICS Datasets and Testbeds for Cybersecurity Research
Ebtesam J. Alqahtani, Mohammad Hammoudeh
Extracting Knowledge from Tools in LLM Agents
Chuanchao Zang, Jianing Wang, Wenyu Chen et al.
SIR: Self-improving Red-teaming for Compute Use Agents
Chen Xiong, Zhiyuan He, Pin-Yu Chen et al.