In this study, unlike other power sequences, we define new ones in the integer and integer-valued polynomial module. We call these sequences the power-generalized [Formula: see text]-Horadam sequence in the integer module and the power-generalized [Formula: see text]-Horadam sequence in the integer-valued polynomial module. Using these sequences, we rebuild the ElGamal cryptosystem and then obtain a new cryptographic method by combining this and symmetric systems. We provide an encryption example where our method is applied. Finally, we see the advantages of the new cryptographic method when we compare the obtained new cryptographic method with some of the asymmetric cryptographic systems such as RSA and ElGamal. And we achieve that new cryptographic method that has more advantageous.
In this article, firstly, we have described new generalizations of generalized k - Horadam sequence and we named the generalizations as another generalized k - Horadam sequence {H k,n}nE, a different generalized k - Horadam sequence {qk,n} and an altered generalized k - Horadam sequence {Qk,n) , respectively. Then, we have studied properties of these new generalizations and we have obtained generating function and extended Binet formula for each generalization. Also, we have introduced a power sequence for an altered generalized k - Horadam sequence in order to be used in different applications like number theory, cryptography, coding theory and engineering.
In this study, we worked on the third-order bivariate variant of the Fibonacci universal code and the second-order bivariate variant of the Narayana universal code, depending on two negative integer variables u and v. We then showed in tables these codes for 1≤k≤100, u=-1,-2,…,-20, and v=-2,-3,…,-21 (u and v are consecutive, v
We all know that every positive integer has a unique Fibonacci representation, but some positive integers have multiple Gopala Hemachandra (GH) representations, or some positive integers haven't any GH representation. Here, the authors found the first k-positive integer k=(3 2^((m-1))-1) for which there is no Zeckendorf's representation for Gopala Hemachandra sequence whose order m. Thus, the authors formulated the first positive integer whose Zeckendorf's representation can't be found in terms of its order. The authors also described the fourth, the fifth, and the sixth order GH representation of positive integers and obtained the fifth and the sixth order GH representations of the first 26 positive integers uniformly according to a certain rule with a table. Finally, the authors used these GH representations in symmetric cryptography, and the authors made some applications with a method which they construct similar to Nalli and Ozyilmaz.
Bu çalışmada, ilk olarak, kaynak [13]de Ide ve Renault tarafından tanımlanan Fibonacci kuvvet dizilerini inceledik. Sonrasında, sırasıyla u=1,v=3 ve u=3,v=1 için modül s de iki tane Horadam kuvvet dizisi tanımladık. Bu iki kuvvet dizisinin var olduğu s modüllerini ve verilen bir s modülü için bu dizilerin sayısını belirledik. u=1,v=3 ve u=3,v=1 durumları için tanımladığımız bu Horadam kuvvet dizilerinin periyotlarını, Horadam dizilerinin periyotları cinsinden formülize ettik. Son olarak, Horadam kuvvet dizilerinin elde ettiğimiz periyot formülleri ile Fibonacci kuvvet dizilerinin periyot formüllerini karşılaştırdık. u=3,v=1 için Horadam kuvvet dizilerinin periyot formülleri Fibonacci kuvvet dizilerinin periyot formülleri ile aynı iken u=1,v=3 durumunda bu iki kuvvet dizisinin periyotları arasında belirli bir ilişki kurulamadığını elde ettik.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.