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
  • Araştırmacılar
  • Projeler
  • Birimler
  • Analiz
  • 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 "Fallahgoul, H." seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Küçük Resim Yok
    Yayın
    Approximating the p.d.f of ?-stable distribution by using pade and spline interpolation
    (Maltepe Üniversitesi, 2009) Fallahgoul, H.; Hashemiparast, S. M.
    Improvements in numerical evaluation of ?-stable distribution are presented, the proposed approach is mainly based on Pade and Spline interpolation, for approximating the p.d.f of ?-stable distribution a procedure is presented, the algorithm for the approximation of ?-stable densities is developed, and the results are compared with the other methods and the accuracy of the algorithm is verified. finally numerical example are presented for illumination.
  • Küçük Resim Yok
    Yayın
    Hash function based on chaos
    (Maltepe Üniversitesi, 2009) Hashemiparast, S. M.; Fallahgoul, H.
    Data encryption has an important role in communication security, hash function in a kind of encryption of data and the famous hash functions like SHA, MD4, MD5, WHIRPOOL need a great deal of computations even for the small messages. There are some other methods based on chaos which are in fact the art of security achievement by encoding the messages to make them non-readable, the chaos based encryptions are widely extended since last ten years, because of chose relations between chaos and cryptography and chaotic systems having some properties such as sensitivity to the initial conditions, and control parameters, and randomized behavior which can be connected with some conventional properties of good ciphers such as confusion/diffusion, secures the communications[1]. The algorithms are mostly constituted on a linear or nonlinear mapping [2, 3,] as the random encryptions are performed in this algorithms, the algorithms posses a high level of security. In this paper we introduce a one-sided hash function algorithm is constructed on exponential scores with a changeable parameter say p. A section of this function is given, in each run block ciphers encryption procedure produces the parameter p then the value of hash function is obtained by randomized setting of the first few sequences of iterations. Statistical analysis and computer simulation indicates a good performance of Hash function and is reliable with high potential.

| Maltepe Üniversitesi | Kütüphane | Açık Bilim Politikası | 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.


Maltepe Üniversitesi Kütüphane ve Dokümantasyon Daire Başkanlığı, İ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