A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Evaluating logarithms in GF(2n)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth 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
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Solving low density subset sum problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Finding irreducible polynomials over finite fields
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A public-key cryptosystem based on shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Practical Security in Public-Key Cryptography
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Relationship between weight of plaintext and successful attacks in knapsack cryptosystems
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
New definition of density on knapsack cryptosystems
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
We introduce a new knapsack type public key cryptosystem. The system is based on a novel application of arithmetic in finite fields, following a construction by Bose and Chowla. Appropriately choosing the parameters, we can control the density of the resulting knapsack. In particular, the density can be made high enough to foil "low density" attacks against our system. At the moment, we do not know of any attacks capable of "breaking" this system in a reasonable amount of time.