ON THE k-TH ORDER LFSR SEQUENCE WITH PUBLIC KEY CRYPTOSYSTEMS

Date

2017-06-01

Author

KIRLAR, Barış Bülent
Cil, Melek

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

2
views

0
downloads

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 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. (C) 2017 Mathematical Institute Slovak Academy of Sciences

Subject Keywords

General Mathematics

URI

https://hdl.handle.net/11511/64619

Collections

Graduate School of Applied Mathematics, Article