Facebook Instagram Twitter RSS Feed PodBean Back to top on side

On the $k$-th order LFSR sequence with public key cryptosystems

In: Mathematica Slovaca, vol. 67, no. 3
Bariş Bülent Kirlar - Melek Çil

Details:

Year, pages: 2017, 601 - 610
Keywords:
$k$-th order LFSR sequence, encryption scheme, semantic security
About article:
In this paper, we propose a novel encryption scheme based on the concepts of the commutative law of the $k$-th order linear recurrences over the finite field $\mathbb{F}q$ for $k>2$. The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving some Linear Feedback Shift Register (LFSR) problems. It has also the property of semantic security. For $k=2$, we propose another encryption scheme by using the commutative law of Lucas and Fibonacci sequences having also the same security as proposed for $k>2$.
How to cite:
ISO 690:
Kirlar, B., Çil, M. 2017. On the $k$-th order LFSR sequence with public key cryptosystems. In Mathematica Slovaca, vol. 67, no.3, pp. 601-610. 0139-9918. DOI: https://doi.org/10.1515/ms-2016-0294

APA:
Kirlar, B., Çil, M. (2017). On the $k$-th order LFSR sequence with public key cryptosystems. Mathematica Slovaca, 67(3), 601-610. 0139-9918. DOI: https://doi.org/10.1515/ms-2016-0294
About edition:
Published: 27. 6. 2017