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

2017-06-01
KIRLAR, Barış Bülent
Cil, Melek
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
MATHEMATICA SLOVACA

Suggestions

On the Krall-type polynomials on q-quadratic lattices
Alvarez-Nodarse, R.; Adiguzel, R. Sevinik (Elsevier BV, 2011-08-01)
In this paper, we study the Krall-type polynomials on non-uniform lattices. For these polynomials the second order linear difference equation, q-basic series representation and three-term recurrence relations are obtained. In particular, the q-Racah-Krall polynomials obtained via the addition of two mass points to the weight function of the non-standard q-Racah polynomials at the ends of the interval of orthogonality are considered in detail. Some important limit cases are also discussed. (C) 2011 Royal Net...
On quasi-compactness of operator nets on Banach spaces
Emelyanov, Eduard (Institute of Mathematics, Polish Academy of Sciences, 2011-01-01)
The paper introduces a notion of quasi-compact operator net on a Banach space. It is proved that quasi-compactness of a uniform Lotz-Rabiger net (T(lambda))(lambda) is equivalent to quasi-compactness of some operator T(lambda). We prove that strong convergence of a quasi-compact uniform Lotz-Rabiger net implies uniform convergence to a finite-rank projection. Precompactness of operator nets is also investigated.
Improved p-ary codes and sequence families from Galois rings of characteristic p(2)
LİNG, SAN; Özbudak, Ferruh (Society for Industrial & Applied Mathematics (SIAM), 2006-01-01)
This paper explores the applications of a recent bound on some Weil-type exponential sums over Galois rings in the construction of codes and sequences. A family of codes over F-p, mostly nonlinear, of length p(m+1) and size p(2) (.) p(m(D-[D/p2])), where 1 <= D <= p(m/2), is obtained. The bound on this type of exponential sums provides a lower bound for the minimum distance of these codes. Several families of pairwise cyclically distinct p-ary sequences of period p(p(m - 1)) of low correlation are also cons...
On the sequential order continuity of the C(K)-space
Ercan, Z.; Onal, S. (Springer Science and Business Media LLC, 2007-03-01)
As shown in [1], for each compact Hausdorff space K without isolated points, there exists a compact Hausdorff P'-space X but not an F-space such that C(K) is isometrically Riesz isomorphic to a Riesz subspace of C(X). The proof is technical and depends heavily on some representation theorems. In this paper we give a simple and direct proof without any assumptions on isolated points. Some generalizations of these results are mentioned.
On a Fitting length conjecture without the coprimeness condition
Ercan, Gülin (Springer Science and Business Media LLC, 2012-08-01)
Let A be a finite nilpotent group acting fixed point freely by automorphisms on the finite solvable group G. It is conjectured that the Fitting length of G is bounded by the number of primes dividing the order of A, counted with multiplicities. The main result of this paper shows that the conjecture is true in the case where A is cyclic of order p (n) q, for prime numbers p and q coprime to 6 and G has abelian Sylow 2-subgroups.
Citation Formats
B. B. KIRLAR and M. Cil, “ON THE k-TH ORDER LFSR SEQUENCE WITH PUBLIC KEY CRYPTOSYSTEMS,” MATHEMATICA SLOVACA, pp. 601–610, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64619.