A Knapsack-Like Code Using Recurrence Sequence Representations
Number Theory
2015-03-17 v1 Cryptography and Security
Information Theory
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1503.04238,
title = {A Knapsack-Like Code Using Recurrence Sequence Representations},
author = {Nathan Hamlin and Bala Krishnamoorthy and William Webb},
journal= {arXiv preprint arXiv:1503.04238},
year = {2015}
}
Comments
9 pages