A Novel Combinatorial Public Key Cryptosystem

Authors:
Baocang Wang;Yupu Hu
Affiliations:
Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an 710071, China and State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sci ...;Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an 710071, China
Venue:
Informatica
Year:
2010

Citing 14
Cited 1

The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Algebraic aspects of cryptography

Algebraic aspects of cryptography
New Public-Key Cryptosystem Using Braid Groups

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
A knapsack-based probabilistic encryption scheme

Information Sciences: an International Journal
New Digital Signature Scheme in Gaussian Monoid

Informatica
One Digital Signature Scheme in Semimodule over Semiring

Informatica
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level

Informatica
Quadratic compact knapsack public-key cryptosystem

Computers & Mathematics with Applications
Adaptively Secure Threshold Signature Scheme in the Standard Model

Informatica
Lattice attacks on NTRU

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Identity-Based Threshold Proxy Signature from Bilinear Pairings

Informatica
Delegatability of an Identity Based Strong Designated Verifier Signature Scheme

Informatica
Cryptanalysis of Polly Cracker

IEEE Transactions on Information Theory

Implicit polynomial recovery and cryptanalysis of a combinatorial key cryptosystem

ICICS'12 Proceedings of the 14th international conference on Information and Communications Security

Quantified Score

Hi-index	0.00

Visualization

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.