HackerPapers

arXiv:1503.04238math.NT

A Knapsack-Like Code Using Recurrence Sequence Representations

Nathan Hamlin, Bala Krishnamoorthy, William Webb

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
9 pages
Journal reference
Fibonacci Quarterly. 1(53), 24-33 (2015)
DOI
Subjects
math.NTNumber Theory cs.CRCryptography and Security cs.ITInformation Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Apr 2015 to Apr 2015.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Mathematicians build code to take on toughest cyber attacks 1 comment

    • It's kind of sad when university press departments don't include a link to the actual research. The paper that this summarizes can be found at http://arxiv.org/pdf/1503.04238v1.pdf (I thought the summary was pretty clear and unusually technically accurate, although they don't…

      schoenView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.