Computational complexities of diophantine equations with parameters
Journal of Algorithms
Complexity of sentences over number rings
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptography and data security
Cryptography and data security
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An NP-complete number-theoretic problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)
IEEE Transactions on Information Theory
Cryptanalysis of a Diophantine Equation Oriented Public Key Cryptosystem
IEEE Transactions on Computers
Comment on "A New Public-Key Cipher System Based Upon the Diophantine Equations"
IEEE Transactions on Computers
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
Scalable key management for secure multicast communication in the mobile environment
Pervasive and Mobile Computing
Particle swarm optimisation based Diophantine equation solver
International Journal of Bio-Inspired Computation
| Hi-index | 14.99 |
A new public-key (two-key) cipher scheme is proposed in this paper. In our scheme, keys can be easily generated. In addition, both encryption and decryption procedures are simple. To encrypt a message, the sender needs to conduct a vector product of the message being sent and the enciphering key. On the other hand, the receiver can easily decrypt it by conducting several multiplication operations and modulus operations. For security analysis, we also examine some possible attacks on the presented scheme