Yazar "Nalli, A." seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    Composite discrete logarithm problem and a reconstituted elgamal cryptosystem based on the problem: New elgamal cryptosystems with some special sequences and composite elgamal cryptosystem
    (IGI Global, 2020) Özyilmaz, Ç.; Nalli, A.
    In this chapter, the authors have defined a new ElGamal cryptosystem by using the power Fibonacci sequence module m. Then they have defined a new sequence module m and the other ElGamal cryptosystem by using the new sequence. In addition, they have compared that the new ElGamal cryptosystems and ElGamal cryptosystem in terms of cryptography. Then the authors have defined the third ElGamal cryptosystem. They have, particularly, called the new system as composite ElGamal cryptosystem. The authors made an application of composite ElGamal cryptosystem. Finally, the authors have compared that composite ElGamal cryptosystem and ElGamal cryptosystem in terms of cryptography and they have obtained that composite ElGamal cryptosystem is more advantageous than ElGamal cryptosystem. © 2020, IGI Global.
  • Küçük Resim Yok
    Öğe
    The fifth and the sixth order gopala hemachandra representations and the use of these representations in symmetric cryptography
    (IGI Global, 2022) Çelemoglu, C.; Nalli, A.
    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. © 2022, IGI Global. All rights reserved.
  • Küçük Resim Yok
    Öğe
    On the Pentanacci numbers
    (Association for Scientific Research, 2014) Sarisahin, T.; Nalli, A.
    In this paper, we give recurrence relation obtained by using from [1] for Pentanacci sequence. Furthermore, we construct generating matrix for P6n, P6n. Finally, we represent relationships between Pentanacci sequence and permanents of certain matrices. © 2014, Association for Scientific Research. All rights reserved.