A knapsack-like code using recurrence sequence representations

MaRDI QIDQ4689692zbMATH OpenFDO

Authors Nathan Hamlin, Bala Krishnamoorthy, William A. Webb

Publication date 17 October 2018

Full work available at URL https://arxiv.org/abs/1503.04238, https://www.fq.math.ca/Abstracts/53-1/hamlin.pdf

Mathematics Subject Classification ID

Recurrences (11B37) Calculation of integer sequences (11Y55) Cryptography (94A60)

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.

Recommendations

• scientific article; zbMATH DE number 691485
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• scientific article; zbMATH DE number 3989251
• Non-injective knapsack public-key cryptosystems
• Quadratic compact knapsack public-key cryptosystem

This page was built for publication: A knapsack-like code using recurrence sequence representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689692)