A Public Key Cryptosystem Based on Non-abelian Finite Groups
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...
Saved in:
| Published in | Journal of cryptology Vol. 22; no. 1; pp. 62 - 74 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer-Verlag
01.01.2009
Springer Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0933-2790 1432-1378 1432-1378 |
| DOI | 10.1007/s00145-008-9033-y |
Cover
| Summary: | 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. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0933-2790 1432-1378 1432-1378 |
| DOI: | 10.1007/s00145-008-9033-y |