scholarly journals An Effective S-box Construction Based on Linear Recurrences with Constant Co-Efficient

2022 ◽  
Author(s):  
Nasir Siddiqui ◽  
Wajeeha Iftikhar ◽  
Muhammad Ehatisham Ul Haq
Keyword(s):  
Linear Recurrences

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

scholarly journals ON THE GROWTH OF LINEAR RECURRENCES IN FUNCTION FIELDS

2020 ◽  
pp. 1-10
Author(s):  
CLEMENS FUCHS ◽  
SEBASTIAN HEINTZE
Keyword(s):  
Number Field ◽  
Function Field ◽  
Function Fields ◽  
Linear Recurrence ◽  
Recurrence Sequence ◽  
Linear Recurrences ◽  
Field Case ◽  
Power Sum ◽  
Linear Recurrence Sequence

Abstract Let $ (G_n)_{n=0}^{\infty } $ be a nondegenerate linear recurrence sequence whose power sum representation is given by $ G_n = a_1(n) \alpha _1^n + \cdots + a_t(n) \alpha _t^n $ . We prove a function field analogue of the well-known result in the number field case that, under some nonrestrictive conditions, $ |{G_n}| \geq ( \max _{j=1,\ldots ,t} |{\alpha _j}| )^{n(1-\varepsilon )} $ for $ n $ large enough.

scholarly journals Automatic Hierarchical Parallelization of Linear Recurrences

2018 ◽  
Vol 53 (2) ◽  
pp. 128-138
Author(s):  
Sepideh Maleki ◽  
Martin Burtscher
Keyword(s):  
Linear Recurrences

α-expansions, linear recurrences, and the sum-of-digits function

1991 ◽  
Vol 70 (1) ◽  
pp. 311-324 ◽  
Author(s):  
Peter J. Grabner ◽  
Robert F. Tichy
Keyword(s):  
Linear Recurrences ◽  
Sum Of Digits ◽  
Sum Of Digits Function

scholarly journals Hyers-Ulam Stability of a System of First Order Linear Recurrences with Constant Coefficients

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Bing Xu ◽  
Janusz Brzdęk
Keyword(s):  
Ulam Stability ◽  
Linear Difference Equations ◽  
Positive Real ◽  
Fixed Sequence ◽  
Linear Recurrences ◽  
Order Linear ◽  
First Order ◽  
Constant Coefficients ◽  
Complex Coefficients ◽  
Positive Real Constant

We study the Hyers-Ulam stability in a Banach spaceXof the system of first order linear difference equations of the formxn+1=Axn+dnforn∈N0(nonnegative integers), whereAis a givenr×rmatrix with real or complex coefficients, respectively, and(dn)n∈N0is a fixed sequence inXr. That is, we investigate the sequences(yn)n∈N0inXrsuch thatδ∶=supn∈N0yn+1-Ayn-dn<∞(with the maximum norm inXr) and show that, in the case where all the eigenvalues ofAare not of modulus 1, there is a positive real constantc(dependent only onA) such that, for each such a sequence(yn)n∈N0, there is a solution(xn)n∈N0of the system withsupn∈N0yn-xn≤cδ.

scholarly journals A three-phase parallel algorithm for solving linear recurrences

1991 ◽  
Vol 21 (2-3) ◽  
pp. 187-195
Author(s):  
Kuo-Liang Chung ◽  
Ferng-Ching Lin ◽  
Yeong-Nan Yeh
Keyword(s):  
Parallel Algorithm ◽  
Linear Recurrences ◽  
Three Phase
Sign in / Sign up

Export Citation Format

Share Document