From golden to unimodular cryptography

Sergiy Koshkin and Taylor Styers

Chaos, Solitons & Fractals, 2017, vol. 105, issue C, 208-214

Abstract: We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q matrices, and prove that it preserves the original error correction properties of the encryption. Moreover, the additional parameters involved in generating the coding matrices make this unimodular cryptography resilient to the chosen plaintext attacks that worked against the golden cryptography. Finally, we show that even the golden cryptography is generally unable to correct double errors in the same row of the ciphertext matrix, and offer an additional check number which, if transmitted, allows for the correction.

Keywords: Fibonacci numbers; Recurrence relation; Golden ratio; Golden matrix; Unimodular matrix; Symmetric cipher; Error correction; Chosen plaintext attack (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077917304319
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:105:y:2017:i:c:p:208-214

DOI: 10.1016/j.chaos.2017.10.015

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().