A file protection system based on a trapdoor one-way hash function
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics
Finite Fields and Their Applications
Fundamenta Informaticae
Information protection systems based on universal knapsack problem
Proceedings of the 6th International Conference on Security of Information and Networks
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems
Journal of Global Optimization
| Hi-index | 0.00 |
A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-density attacks against the system. At the moment, no attacks capable of breaking the system in a reasonable amount of time are known