Cryptographic Functions and Bit-Error-Rate Analysis with Almost p-ary Sequences
INTERNATIONAL JOURNAL OF INFORMATION SECURITY SCIENCE, vol.8, no.3, pp.44-52, 2019 (TRDizin)
- Publication Type: Article / Article
- Volume: 8 Issue: 3
- Publication Date: 2019
- Journal Name: INTERNATIONAL JOURNAL OF INFORMATION SECURITY SCIENCE
- Journal Indexes: TR DİZİN (ULAKBİM)
- Page Numbers: pp.44-52
- Middle East Technical University Affiliated: Yes
Abstract
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.