New public key cryptosystem using finite non Abelian groups

53Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. It is convertible to a scheme in which the encryption and decryption are much faster than other well-known public key cryptosystems, even without no message expansion. Furthermore a signature scheme can be easily derived from it, while it is difficult to find a signature scheme using a non abelian group. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Paeng, S. H., Ha, K. C., Kim, J. H., Chee, S., & Park, C. (2001). New public key cryptosystem using finite non Abelian groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2139, 470–485. https://doi.org/10.1007/3-540-44647-8_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free