A Knapsack-Like Code Using Recurrence Sequence Representations
This work addresses cryptographic security for data encryption, but it appears incremental as it builds on prior recurrence sequence representations.
The paper tackles the problem of constructing a public key cryptosystem by leveraging unique integer representations with recurrence sequences, resulting in a knapsack-like code with new disguising methods and security arguments against known attacks.
We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build a knapsack-like public key cryptosystem. We also present new disguising methods, and provide arguments for the security of the code against known methods of attack.