A Public Key Cryptosystem Based on Non-abelian Finite Groups

Authors:
Wolfgang Lempken;Trung van Tran;Spyros S. Magliveras;Wandi Wei
Affiliations:
Universität Duisburg-Essen, Institut für Experimentelle Mathematik, Ellernstrasse 29, 45326, Essen, Germany;Universität Duisburg-Essen, Institut für Experimentelle Mathematik, Ellernstrasse 29, 45326, Essen, Germany;Florida Atlantic University, Department of Mathematical Sciences, Center for Cryptology and Information Security, 33431, Boca Raton, FL, USA;Florida Atlantic University, Department of Mathematical Sciences, Center for Cryptology and Information Security, 33431, Boca Raton, FL, USA
Venue:
Journal of Cryptology
Year:
2008

Citing 0
Cited 3

Minimal logarithmic signatures for classical groups

Designs, Codes and Cryptography
Pseudorandom number generators based on random covers for finite groups

Designs, Codes and Cryptography
Pseudorandom generators based on subcovers for finite groups

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approach to designing public-key cryptosystems based on covers and logarithmic signatures of non-abelian finite groups. Initially, we describe a generic version of the system for a large class of groups. We then propose a class of 2-groups and argue heuristically about the system’s security. The system is scalable, and the proposed underlying group, represented as a matrix group, affords significant space and time efficiency.