The Knapsack Cryptography with Bell Number using Python Programming
Nilgün Demir,Setenay Doğan,Furkan Tokaç +2 more
- 31 Dec 2018
- Iss: 14, pp 334-336
TL;DR: The Bell numbers in the form of ‘super- increasing sequence’, which constitute the hypotenuse of the Bell triangle, are generated in the Python programming and it was observed that the Bell numbers are suitable for Knapsack encryption.
read more
Abstract: The cryptology is consisted of Kryptos ( hidden) and logos (word) terms in the Greek. It also means that “secrecy science” at the communication. In the present days, the expansion of the electronic comminucation network has more increased the importance of cryptology. In this work, we have focused on Knapsack cryptosystem. In this purpose, the Bell numbers in the form of ‘super- increasing sequence’, which constitute the hypotenuse of the Bell triangle, are generated in the Python programming. The Knapsack encryption and decryption of these numbers are modeled using the Python program. Furthermore, the encryption was tested on a physical equation and it was observed that the Bell numbers are suitable for Knapsack encryption.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
References
Hiding information and signatures in trapdoor knapsacks
TL;DR: Specific instances of the knapsack problem that appear very difficult to solve unless one possesses "trapdoor information" used in the design of the problem are demonstrated.
A novel public key cryptosystem based on Merkle-Hellman Knapsack Cryptosystem
M. Thangavel,P. Varalakshmi +1 more
- 01 Jan 2017
TL;DR: A novel public key cryptosystem based on MHKC (NPKC-MHKC) has been proposed, which is secure than MHKC and can be implemented in High-performance computing applications.
12
A New Knapsack Public-Key Cryptosystem
Weidong Zhang,Baocang Wang,Yupu Hu +2 more
- 18 Aug 2009
TL;DR: It is shown that the cryptosystem resists some brute-force attacks and the simultaneous Diophantine approximation attack and is suited for software and hardware implementations.
11
Analysis of the improved knapsack cipher
Ashish Jain,Narendra S. Chaudhari +1 more
- 20 Aug 2015
TL;DR: This paper identifies a construction of practical knapsack cipher 0/f, characterize its requirements and demonstrates asymptotically, that the computational complexity of the knapsacksack cipher 1/f and knapsacking cipher0/1 (basic or sum-of-subset cipher) is equal.
2