Cryptographic Functions and Bit-Error-Rate Analysis with Almost p-ary Sequences

ÖZDEN B., YAYLA O.

INTERNATIONAL JOURNAL OF INFORMATION SECURITY SCIENCE, cilt.8, sa.3, ss.44-52, 2019 (TRDizin) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 8 Sayı: 3
  • Basım Tarihi: 2019
  • Dergi Adı: INTERNATIONAL JOURNAL OF INFORMATION SECURITY SCIENCE
  • Derginin Tarandığı İndeksler: TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.44-52
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Sequences are used for achieving non-linearity in a cryptosystem, and they are important in Code Division MultipleAccess (CDMA) to ensure a proper communication. In this study, we show a method for obtaining cryptographic functions fromp-ary sequences with s consecutive zero-symbols of type (1; 2). In fact, most of the cases we obtain functions with the highestnon-linearity, i.e. generalized bent functions. In CDMA, instead of distributing time and frequency sources to users, each user isgiven a unique sequence to transmit data at the same frequency and time. In this study, we examined the bit-error-rate (BER)performance of p-ary sequences with s consecutive zero-symbols of type (1; 2) on CDMA.