A novel combinatorial public key cryptosystem

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptographic community. In this paper, a combinatorial public key cryptosystem is proposed. The security of the proposed cryptosystem is dependent on a combinatorial problem involving matrices. The system features fast encryption and decryption. However, the system also suffers from some drawbacks. The ciphertext expansion is relatively large and the key sizes are somewhat larger than that of RSA. The security of the system is carefully examined by illustrating the computational infeasibilities of some attacks on the system. © 2010 Vilnius University.

Cite

CITATION STYLE

APA

Wang, B., & Hu, Y. (2010). A novel combinatorial public key cryptosystem. Informatica, 21(4), 611–626. https://doi.org/10.15388/informatica.2010.308

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