Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Temiz, Fatih" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Yükleniyor...
    Küçük Resim
    Öğe
    A generalization of the Mignotte’s scheme over Euclidean domains and applications to secret image sharing
    (Jacodesmath Institute, 2019) Ozbek, Ibrahim; Temiz, Fatih; Siap, Irfan
    Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different (k, n) threshold modular secret sharing scheme by using the Chinese remainder theorem. In this study, we explore the generalization of Mignotte’s scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte’s scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security. © 2019, Jacodesmath Institute. All rights reserved.
  • Yükleniyor...
    Küçük Resim
    Öğe
    Reversibility of a family of 2D cellular automata hybridized by diamond and cross rules over finite fields and an application to visual cryptography
    (Old City Publishing, 2019) Temiz, Fatih; Sah, Ferhat; Akin, Hasan
    This article studies the behavior of two-dimensional finite cellular automata defined by two special family of rules under null boundary condition. The rule matrices of these families of two-dimensional hybrid cellular automata composed by diamond and cross rules respectively over the finite field Fp (p prime) are established. Further, explicit formulae that gives the rank of these rule matrices are provided. Hence, we are able to determine the reversibility of these cellular automata. Finally, we conclude by presenting an application of this family to pseudo random number generators applied to visual cryptography. © 2019 Old City Publishing, Inc.

| İstanbul Gelişim Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Cihangir Mahallesi, Şehit Jandarma Komando Er Hakan Öner Sokak, No:1, Avcılar, İstanbul, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim